Patent application number | Description | Published |
20110238873 | DOCUMENT FINISHING DEVICE, AND METHOD FOR CONFIGURING SUCH A DEVICE - A method for configuring a document finishing device, such as a folding, binding or stapling machine, includes the steps of storing data referring to the selected command on a portable data storage device, connecting the portable data storage device to the document finishing device and reading the data from the data storage device into the document finishing device and configuring a functionality of at least one key of the document finishing device, based on data read from the data storage device. A document finishing device and a portable data storage device for carrying out the method are also provided. | 09-29-2011 |
20130083114 | PRINTER ASSEMBLY - A printer assembly is configured to be arranged on a support surface and comprises: a medium delivery station and a printing station comprising a moveably arranged element. The printer assembly extends between a first end and a second end, wherein the printer is configured to be supported on the support surface at the first end. The medium delivery station and the printing station are arranged on a line extending between the first end and the second end. The printing station is arranged closer to the first end than the medium delivery station. A direction of movement of the moveably arranged element is not parallel to said line extending between the first end and the second end. | 04-04-2013 |
20150042039 | OUTPUT ASSEMBLY FOR RECEIVING A SHEET OUTPUT BY A PRINTING DEVICE - In order to enable simple and easy handling of a large number of large format sheets, an output assembly is provided. The output assembly comprises a lower output tray element for receiving the sheets. In order to reliably transport and deposit a large format sheet from the printing device onto the lower output tray element, a guide element is provided just below an output opening of the printing device such to guide a leading edge of the sheet onto the lower output tray element. Once the leading edge is supported by the lower output tray element, the guide element is retracted such to enable a trailing edge to be deposited on the lower output tray element. | 02-12-2015 |
20150062271 | INKJET PRINTER ASSEMBLY USING A GELLING UV CURABLE INK - An inkjet printer assembly for printing an image on a recording medium comprises a medium support surface for supporting a recording medium; an inkjet print head for ejecting droplets of an UV-curable ink on the recording medium, the inkjet print head being arranged over the medium support surface; an UV radiation source for irradiating the droplets of UV-curable ink on the recording medium, the UV radiation source being arranged over the medium support surface; a covering arranged over the medium support surface, the covering and the medium support surface together enclosing a print space including the inkjet print head and the UV radiation source; and exhaust means, the exhaust means being configured to vent the print space. The covering comprises a window part arranged such to allow a view on the medium support surface, the window part being at least partially transparent for visible light and configured to filter UV radiation from the UV radiation source to an extent that no harmful amount of UV radiation passes through. Thus, an operator is enabled to view a print result directly as it is printed without being subjected to harmful radiation. | 03-05-2015 |
Patent application number | Description | Published |
20090175275 | FLEXIBLE NETWORK PROCESSOR SCHEDULER AND DATA FLOW - A network processor dataflow chip and method for flexible dataflow are provided. The dataflow chip comprises a plurality of on-chip data transmission and scheduling circuit structures. The data transmission and scheduling circuit structures are selected responsive to indicators. Data transmission circuit structures may comprise selectable frame processing and data transmission functions. Selectable frame processing may comprise cut and paste, full dispatch and store and dispatch frame processing. Scheduling functions include full internal scheduling, calendar scheduling in communication with an external scheduler, and external calendar scheduling. In another aspect of the present invention, data transmission functions may comprise low latency and normal latency external processor interfaces for selectively providing privileged access to dataflow chip resources. | 07-09-2009 |
20130194964 | SYNCHRONIZING ROUTING TABLES IN A DISTRIBUTED NETWORK SWITCH - Techniques are provided for routing table synchronization for a distributed network switch. In one embodiment, a first frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a first switch module, routing information is determined for the source address and a routing entry is generated. An indication is sent to a second switch module, to request a routing entry for the source address to be generated in the second switch module, based on the routing information. | 08-01-2013 |
20130195105 | SYNCHRONIZING ROUTING TABLES IN A DISTRIBUTED NETWORK SWITCH - Techniques are provided for routing table synchronization for a distributed network switch. In one embodiment, a first frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a first switch module, routing information is determined for the source address and a routing entry is generated. An indication is sent to a second switch module, to request a routing entry for the source address to be generated in the second switch module, based on the routing information. | 08-01-2013 |
20130311436 | COMPUTER INTERFACE SYSTEM - An improved computer system may include a controller including a computer processor. The system may also include a selector apparatus in communication with the controller to choose a table having a higher collision quality index than other tables under consideration by the selector apparatus. The system may further include an exchanger apparatus to configure a standby table that replaces the table chosen by the selector apparatus. The system may additionally include a switch that changes a hash function based upon the exchanger apparatus' replacement of the chosen table to enable the controller to reduce insertion times and/or collisions when interfacing with new components introduced to the controller. | 11-21-2013 |
20130311492 | HASH COLLISION REDUCTION SYSTEM - An improved computer system that can include a controller having a computer processor, the controller to reduce insertion times and/or collisions when interfacing with new components introduced to the controller. The system may also include a collision avoidance apparatus that reduces hashing collisions by using a plurality of tables and a plurality of keys per bucket. The system may further include a hash apparatus in communication with the controller to map the plurality of keys to the plurality of tables where the hash apparatus uses a single hash logic to provide an avalanche effect when one key is changed which results in nearly half of bits changing in the plurality of tables. | 11-21-2013 |
20140173128 | FLOW DISTRIBUTION ALGORITHM FOR AGGREGATED LINKS IN AN ETHERNET SWITCH - Link aggregation is a practice that uses multiple Ethernet links between two end points in order to obtain higher bandwidth and resiliency than possible with a single link. A flow distribution technique is provided to distribute traffic between the two end points equally across all links in the group and achieve greater efficiency. The flow distribution technique generates and sub-divides a hash value based on received packet flow. The divided portions of the hash value are used in a hierarchical fashion to select a link to use for this packet. | 06-19-2014 |
20140173129 | FLOW DISTRIBUTION ALGORITHM FOR AGGREGATED LINKS IN AN ETHERNET SWITCH - Link aggregation is a practice that uses multiple Ethernet links between two end points in order to obtain higher bandwidth and resiliency than possible with a single link. A flow distribution technique is provided to distribute traffic between the two end points equally across all links in the group and achieve greater efficiency. The flow distribution technique generates and sub-divides a hash value based on received packet flow. The divided portions of the hash value are used in a hierarchical fashion to select a link to use for this packet. | 06-19-2014 |
Patent application number | Description | Published |
20140064090 | CACHED ROUTING TABLE MANAGEMENT - Techniques are provided for cached routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry, based on a set of hash functions. Upon accessing the generated routing entry in the modified routing table responsive to a subsequent lookup request for the source address, the set of caches is modified to include the generated routing entry. | 03-06-2014 |
20140064091 | SLICED ROUTING TABLE MANAGEMENT WITH REPLICATION - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received by a switch module having bridge elements and a routing table divided into slices of buckets, each slice having a respective property and including one or more buckets. If a routing entry for the source address is found in a first slice of a first set of buckets of the routing table responsive to a lookup request for the source address, and the property of the first slice satisfies a replication condition, then the routing entry is replicated to a second set of buckets of the routing table. | 03-06-2014 |
20140064092 | SLICED ROUTING TABLE MANAGEMENT WITH REPLICATION - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received by a switch module having bridge elements and a routing table divided into slices of buckets, each slice having a respective property and including one or more buckets. If a routing entry for the source address is found in a first slice of a first set of buckets of the routing table responsive to a lookup request for the source address, and the property of the first slice satisfies a replication condition, then the routing entry is replicated to a second set of buckets of the routing table. | 03-06-2014 |
20140064093 | HASHING-BASED ROUTING TABLE MANAGEMENT - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions. | 03-06-2014 |
20140064276 | HASHING-BASED ROUTING TABLE MANAGEMENT - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions. | 03-06-2014 |
20140064277 | SLICED ROUTING TABLE MANAGEMENT - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, where the routing table is divided into slices of buckets, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions and properties of the slices. | 03-06-2014 |
20140064281 | SLICED ROUTING TABLE MANAGEMENT - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, where the routing table is divided into slices of buckets, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions and properties of the slices. | 03-06-2014 |
20140064282 | CACHED ROUTING TABLE MANAGEMENT - Techniques are provided for cached routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry, based on a set of hash functions. Upon accessing the generated routing entry in the modified routing table responsive to a subsequent lookup request for the source address, the set of caches is modified to include the generated routing entry. | 03-06-2014 |
20140211806 | SLICED ROUTING TABLE MANAGEMENT WITH REPLICATION - Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received by a switch module having bridge elements and a routing table divided into slices of buckets, each slice having a respective property and including one or more buckets. If a routing entry for the source address is found in a first slice of a first set of buckets of the routing table responsive to a lookup request for the source address, and the property of the first slice satisfies a replication condition, then the routing entry is replicated to a second set of buckets of the routing table. | 07-31-2014 |
Patent application number | Description | Published |
20140305128 | METHOD FOR OPERATING A COMBUSTION CHAMBER AND COMBUSTION CHAMBER - A combustion chamber including a body with a fuel supply duct for supplying a fuel into the body and a carrier air supply duct for supplying air into the body. An adjusting system adjusts the carrier air mass flow supplied into the body according to the features of the fuel. | 10-16-2014 |
20140360199 | METHOD OF OPERATING A GAS TURBINE POWER PLANT WITH EXHAUST GAS RECIRCULATION AND CORRESPONDING GAS TURBINE POWER PLANT - The invention relates to a method for operating a gas turbine, in which an oxygen-reduced gas and fresh air are delivered to a compressor of the gas turbine in a radially staged manner, the fresh air being delivered via an outer sector of the inlet cross section in relation to the axis of rotation of the compressor, and the oxygen-reduced gas being delivered via an inner sector of the inlet cross section in relation to the axis of rotation of the compressor. | 12-11-2014 |
20160061114 | METHOD FOR CONTROLLING A GAS TURBINE - The invention relates to a method for controlling a gas turbine, operating with an integral fuel reactivity measurement concept. In order to fast determine a safe operation range of the gas turbine with respect to flashback and blow-out, the method includes deducing the fuel composition and therefore the fuel reactivity by combined measurements of (n−1) physico-chemical properties of a fuel mixture with n>1 fuel components, for deriving the concentration of one component for each physico-chemical property of the fuel gas mixture or for determining of a ratio of the fuels with known compositions and adjusting at least one operation parameter of the gas turbine at least partially based on the determined property of the fuel gas mixture entering the combustors. With the technical solution of the present invention, by way of detecting fast changes in fuel gas, it is assured that the gas turbine may operate with varieties of fuel gas under optimized performance and in safe operation ranges. In actual applications, the present invention may improve flexibility of gas turbines and cost effectiveness of operation of the gas turbines. | 03-03-2016 |