Abstract: An apparatus for laser processing a material including an optical fibre, at least one squeezing mechanism, and a lens. The optical fibre is a multimode optical fibre in which laser radiation propagates in a first optical mode and in a second optical mode. The squeezing mechanism includes at least one periodic surface defined by a pitch. The periodic surface is located adjacent to the optical fibre. The pitch couples the first and second optical modes together. The first optical mode is defined by a first mode order. The second optical mode is defined by a second mode order which is higher than the first mode order. The squeezing mechanism squeezes the periodic surface and optical fibre together with a squeezing force thereby coupling the first optical mode to the second optical mode.

Abstract: Apparatus for laser processing a material (11), which apparatus comprises a laser (1), an optical fibre (2), and a coupler (125), wherein: the laser (1) is connected to the optical fibre (2); the optical fibre (2) is such that laser radiation (13) is able to propagate along the optical fibre (2) in a first optical mode (21) having a first mode order (24), a second optical mode (22) having a second mode order (25), and a third optical mode (23) having a third mode order (26); the third mode order (26) is higher than the second mode order (25); and the second mode order (25) is higher than the first mode order (24); the apparatus being characterized in that: the coupler (125) is configured to switch laser radiation propagating in the first optical mode (21) to the laser radiation propagating in the second order mode (22); and the coupler (125) is configured to switch the laser radiation propagating in the second optical mode (22) to laser radiation propagating in the third order mode (23).

Abstract: Apparatus for laser processing a material (11), which apparatus comprises an optical fibre (2), at least one squeezing mechanism (3), and a lens (4), wherein: the optical fibre (2) is a multimode optical fibre; the optical fibre (2) is such that laser radiation (13) is able to propagate along the optical fibre (2) in a first optical mode (21) and in a second optical mode (22); the squeezing mechanism (3) comprises at least one periodic surface (6) defined by a pitch (7); and the periodic surface (6) is located adjacent to the optical fibre (2); and the apparatus is characterized in that: the pitch (7) couples the first optical mode (21) and the second optical mode C(22) together; the first optical mode (21) is defined by a first mode order (24), and the second optical mode (22) is defined by a second O mode order (25) which is higher than the first mode order (24); the squeezing mechanism (3) is configured to squeeze the periodic surface (6) and the optical fibre (2) together with a squeezing force (12), ther

Abstract: Apparatus for controlling laser processing of a material (10), which apparatus comprises a laser (1) for emitting laser radiation (2); means (3) for directing the laser radiation (2) onto the material (10); at least one detector (4) for detecting optical radiation (5) that is emitted by the material (10); an electronic filter (6) for filtering an electronic signal (7) emitted by the detector (4) in response to the detector (4) detecting the optical radiation (5); and a discriminator (8) for analysing the output (9) from the electronic filter (6), the apparatus being characterised in that the electronic fitter (6) and the discriminator (8) are configured to determine at least one characteristic feature (11) of the electronic signal (7) that is indicative of the processing of the material (10) by the laser radiation (2).

Abstract: A firewall device may include a forwarding component that includes a filter block. The filter block may obtain a first hardware-implemented filter, where a hardware implementation limits the first hardware-implemented filter to a maximum quantity of rules; determine whether a last rule associated with the accessed hardware-implemented filter includes a split-filter action, where the split-filter action identifies a second hardware-implemented filter; and link the second hardware-implemented filter to the first hardware-implemented filter to make the second hardware-implemented filter a logical continuation of the first hardware-implemented filter, in response to determining that the last rule includes the split-filter action.

Abstract: A processor may include a conditional arithmetic logic unit and a main arithmetic logic unit. The conditional arithmetic logic unit may perform a first arithmetic logic operation to generate a first result, and output the result. The main arithmetic logic unit may select input buses among a plurality of data buses that carry the first result from the conditional arithmetic logic unit, perform a second arithmetic logic operation on data provided by the selected input buses to generate a second result, and write the second result in a storage component.

Abstract: A device may emulate target instructions by executing a first set of microinstructions, and may store a base address of a table that includes a microinstruction provided in a second set of microinstructions for emulating the target instructions. The device may also locate the microinstruction based on the stored base address, and emulate one of the target instructions by executing the microinstruction.

Abstract: A processor may include a conditional arithmetic logic unit and a main arithmetic logic unit. The conditional arithmetic logic unit may perform a first arithmetic logic operation to generate a first result, and output the result. The main arithmetic logic unit may select input buses among a plurality of data buses that carry the first result from the conditional arithmetic logic unit, perform a second arithmetic logic operation on data provided by the selected input buses to generate a second result, and write the second result in a storage component.

Abstract: An example hashing unit includes a plurality of hardware-based hash tables, wherein each of the hash tables comprises a plurality of buckets, and wherein the plurality of hash tables comprise a set of zero or more active hash tables and a set of one or more inactive hash tables. An example hashing unit controller is configured to receive a key value to be stored in the hashing unit, determine that one of the inactive hash tables should be activated, and, based on the determination, activate the one of the set of inactive hash tables as a recently activated hash table, determine one of the buckets of the recently activated hash table to which a hash function associated with the recently activated hash table maps the received key value, and store the key value in the determined one of the buckets of the recently activated hash table.

Abstract: An example network device includes a network interface configured to receive a packet of a packet flow, wherein the packet flow is one of a plurality of packet flows processed by the network device, a flow cache configured to receive a lookup key associated with the packet flow, and a Bloom filter configured to process the lookup key. The flow cache is further configured to store information about a portion of the plurality of packet flows processed by the network device, and determine whether to store information about the packet flow by at least applying a selection criterion to processing of the lookup key by the Bloom filter. The flow cache is configured to determine whether the lookup key is stored in the flow cache, and, when the lookup key is stored in the flow cache, retrieve a stored result associated with the lookup key and output the stored result.

Abstract: A processor may include a conditional arithmetic logic unit and a main arithmetic logic unit. The conditional arithmetic logic unit may perform a first arithmetic logic operation to generate a first result, and output the result. The main arithmetic logic unit may select input buses among a plurality of data buses that carry the first result from the conditional arithmetic logic unit, perform a second arithmetic logic operation on data provided by the selected input buses to generate a second result, and write the second result in a storage component.

Abstract: A firewall device may include a forwarding component that includes a filter block. The filter block may obtain a first hardware-implemented filter, where a hardware implementation limits the first hardware-implemented filter to a maximum quantity of rules; determine whether a last rule associated with the accessed hardware-implemented filter includes a split-filter action, where the split-filter action identifies a second hardware-implemented filter; and link the second hardware-implemented filter to the first hardware-implemented filter to make the second hardware-implemented filter a logical continuation of the first hardware-implemented filter, in response to determining that the last rule includes the split-filter action.

Abstract: A firewall device may include a forwarding component that includes a filter block. The filter block may obtain a first hardware-implemented filter, where a hardware implementation limits the first hardware-implemented filter to a maximum quantity of rules; determine whether a last rule associated with the accessed hardware-implemented filter includes a split-filter action, where the split-filter action identifies a second hardware-implemented filter; and link the second hardware-implemented filter to the first hardware-implemented filter to make the second hardware-implemented filter a logical continuation of the first hardware-implemented filter, in response to determining that the last rule includes the split-filter action.

Abstract: An example network device includes a control plane and a filter lookup module that includes a Bloom filter that supports parallel lookup of a maximum number of different prefix lengths. The filter lookup module accesses the Bloom filter to determine a longest length prefix that matches an entry in a set of prefixes. The control plane receives prefix lengths that include more than the maximum number of different prefix lengths supported by the Bloom filter, wherein the set of prefix lengths is associated with one application, generates, based on the received set of prefix lengths, two or more groups of different prefix lengths, wherein each of the two or more groups of different prefix lengths includes no more than the maximum number of different prefix lengths, and programs the filter lookup module with the two or more groups of different prefix lengths associated with the one application.

Abstract: Systems and methods of various embodiments provide mechanisms to support synchronous and asynchronous transactions. Distinct encodings allow an instruction to choose whether to perform any operation synchronously or asynchronously. Separate synchronous and asynchronous result registers hold the data returned in the most recent replies received for synchronous and asynchronous transaction requests, respectively. A status bit indicates whether an asynchronous transaction request is currently outstanding.

Abstract: Described herein are segmented electronic ballasts for a high power are lamp, such as a High Intensity Discharge (“HID”) lamp, capable of drop-in replacement of a pre-existing magnetic ballast and methods of use thereof. In certain aspects, the segmented electronic ballasts described herein include a first housing containing a driver circuit configured to receive electrical power from a source of electrical power and configured to output a conditioned power signal; and also include a second housing containing a striker circuit connected to the driver circuit and configured to receive the conditioned power signal and ignite the lamp. In certain aspects, the methods described herein include removing a transformer of the pre-existing magnetic ballast from a transformer mounting position; and also include fixing the first housing to the transformer mounting position.

Abstract: An example computing device includes a prefix lookup module, and a Bloom filter that includes a set of queues. The prefix lookup module is configured to receive policy configuration information, examine a state of a queue of the set of queues, and determine whether to bypass the first Bloom filter based on the policy configuration information and the state of the queue. In one example, the prefix lookup module may be configured to, using the policy configuration information, determine to bypass the Bloom filter when the queue is full. In another example, the prefix lookup module may be configured to, using the policy configuration information, determine not to bypass the Bloom filter and send a lookup request to the Bloom filter upon determining that the queue is no longer full.

Abstract: A device may receive a request to read data from or write data to a memory that includes a number of memory banks. The request may include an address. The device may perform a mapping operation on the address to map the address from a first address space to a second address space, identify one of the memory banks based on the address in the second address space, and send the request to the identified memory bank.

Abstract: An example network device includes a control plane and a filter lookup module that includes a Bloom filter that supports parallel lookup of a maximum number of different prefix lengths. The filter lookup module accesses the Bloom filter to determine a longest length prefix that matches an entry in a set of prefixes. The control plane receives prefix lengths that include more than the maximum number of different prefix lengths supported by the Bloom filter, wherein the set of prefix lengths is associated with one application, generates, based on the received set of prefix lengths, two or more groups of different prefix lengths, wherein each of the two or more groups of different prefix lengths includes no more than the maximum number of different prefix lengths, and programs the filter lookup module with the two or more groups of different prefix lengths associated with the one application.

Abstract: Methods and systems consistent with the present invention provide efficient packet replication in a router in order to multicast a stream of data. Packets are replicated and processed in a multithreaded environment. Embodiments consistent with the present invention implement a two-stage process for packet replication. The first stage thread will recirculate the packet to multiple second-stage threads. These second-stage threads will then create one or more outgoing copies of the packet. In this way, the copies are handled by multiple threads running in parallel.