Abstract: An example integrated circuit includes a memory including a non-deterministic finite automata (NFA) buffer configured to store a plurality of instructions defining an ordered sequence of instructions of at least a portion of an NFA graph, the portion of the NFA graph comprising a plurality of nodes arranged along a plurality of paths. The NFA engine determines a current symbol and one or more subsequent symbols of a payload segment that satisfy a match condition specified by a subset of instructions of the plurality of instructions for a path of the plurality of paths and in response to determining the current symbol and the one or more subsequent symbols of the payload segment that satisfy the match condition, outputs an indication that the payload data has resulted in a match.

Abstract: An example processing device includes a memory including a discreet finite automata (DFA) buffer configured to store at least a portion of a DFA graph, the DFA graph comprising a plurality of nodes, each of the nodes having zero or more arcs each including a respective label and pointing to a respective subsequent node of the plurality of nodes, at least one of the plurality of nodes comprising a match node, wherein the at least portion of the DFA graph comprises one or more slots of a memory slice, the one or more slots comprising data representing one or more of the arcs for at least one node of the plurality of nodes, and a DFA engine implemented in circuitry, the DFA engine comprising one or more DFA threads implemented in circuitry and configured to evaluate a payload relative to the DFA graph.

Abstract: An example integrated circuit includes a memory including a non-deterministic finite automata (NFA) buffer configured to store a plurality of instructions defining an ordered sequence of instructions of at least a portion of an NFA graph, the portion of the NFA graph comprising a plurality of nodes arranged along a plurality of paths. The NFA engine determines a current symbol and one or more subsequent symbols of a payload segment that satisfy a match condition specified by a subset of instructions of the plurality of instructions for a path of the plurality of paths and in response to determining the current symbol and the one or more subsequent symbols of the payload segment that satisfy the match condition, outputs an indication that the payload data has resulted in a match.

Abstract: An example processing device includes a memory including a non-deterministic finite automata (NFA) buffer configured to store a plurality of instructions defining an ordered sequence of instructions of at least a portion of an NFA graph, the portion of the NFA graph comprising a plurality of nodes arranged along a plurality of paths. The NFA engine determines a current symbol and one or more subsequent symbols of a payload segment that satisfy a match condition specified by a subset of instructions of the plurality of instructions for a path of the plurality of paths and in response to determining the current symbol and the one or more subsequent symbols of the payload segment that satisfy the match condition, outputs an indication that the payload data has resulted in a match.

Abstract: A DFA engine is described that determines whether a current symbol of a payload matches a label of any effective arcs or negative arcs associated with a current node of a DFA graph that are stored in a cache. Responsive to determining that the current symbol does not match a label of any effective or negative arcs associated with the current node of the DFA graph, the DFA engine determines whether the current symbol matches a label of any arc associated with the current node of the DFA graph that is stored in a memory. Responsive to determining that the current symbol matches a label of a particular arc associated with the current node of the DFA graph that is stored in the memory, the DFA engine stores the particular arc in the cache as a new effective arc and uses the particular arc to evaluate the current symbol.

Abstract: A compiler/loader unit for a RegEx accelerator is described that receives a first set of regular expression rules for implementing the RegEx accelerator, generates, based on the first set of regular expression rules, an initial deterministic finite automata (DFA) graph, and generates, an initial memory map for allocating the initial DFA graph to a memory of the RegEx accelerator. The compiler/loader unit receives receive, a second set of one or more new or modified regular expression rules for implementing the RegEx accelerator and in response performs incremental compilation of the second set of regular expressions. The compiler/loader unit generates, based on the second set of one or more regular expression rules, a supplemental DFA graph and reconciles the initial DFA graph with the supplemental DFA graph to generate an updated memory map for allocating the initial DFA graph and the supplemental DFA graph to the memory of the RegEx accelerator.

Abstract: A compiler/loader unit for a RegEx accelerator is described that receives a first set of regular expression rules for implementing the RegEx accelerator, generates, based on the first set of regular expression rules, an initial deterministic finite automata (DFA) graph, and generates, an initial memory map for allocating the initial DFA graph to a memory of the RegEx accelerator. The compiler/loader unit receives receive, a second set of one or more new or modified regular expression rules for implementing the RegEx accelerator and in response performs incremental compilation of the second set of regular expressions. The compiler/loader unit generates, based on the second set of one or more regular expression rules, a supplemental DFA graph and reconciles the initial DFA graph with the supplemental DFA graph to generate an updated memory map for allocating the initial DFA graph and the supplemental DFA graph to the memory of the RegEx accelerator.

Abstract: A DFA engine is described that determines whether a current symbol of a payload matches a label of any effective arcs or negative arcs associated with a current node of a DFA graph that are stored in a cache. Responsive to determining that the current symbol does not match a label of any effective or negative arcs associated with the current node of the DFA graph, the DFA engine determines whether the current symbol matches a label of any arc associated with the current node of the DFA graph that is stored in a memory. Responsive to determining that the current symbol matches a label of a particular arc associated with the current node of the DFA graph that is stored in the memory, the DFA engine stores the particular arc in the cache as a new effective arc and uses the particular arc to evaluate the current symbol.

Abstract: An example processing device includes a memory including a discreet finite automata (DFA) buffer configured to store at least a portion of a DFA graph, the DFA graph comprising a plurality of nodes, each of the nodes having zero or more arcs each including a respective label and pointing to a respective subsequent node of the plurality of nodes, at least one of the plurality of nodes comprising a match node, wherein the at least portion of the DFA graph comprises one or more slots of a memory slice, the one or more slots comprising data representing one or more of the arcs for at least one node of the plurality of nodes, and a DFA engine implemented in circuitry, the DFA engine comprising one or more DFA threads implemented in circuitry and configured to evaluate a payload relative to the DFA graph.

Abstract: An example processing device includes a memory including a non-deterministic finite automata (NFA) buffer configured to store a plurality of instructions defining an ordered sequence of instructions of at least a portion of an NFA graph, the portion of the NFA graph comprising a plurality of nodes arranged along a plurality of paths. The NFA engine determines a current symbol and one or more subsequent symbols of a payload segment that satisfy a match condition specified by a subset of instructions of the plurality of instructions for a path of the plurality of paths and in response to determining the current symbol and the one or more subsequent symbols of the payload segment that satisfy the match condition, outputs an indication that the payload data has resulted in a match.

Abstract: There is provided a method for use by a system. The method includes receiving live broadcasting of a segment of a video content from a live encoder; recording the segment in a video database of the non-transitory memory, receiving edits to the segment from a producer to produce an edited segment, encoding the edited segment to produce an encoded edited segment, and transmitting a network address of the encoded edited segment to a content management system (CMS) for distribution to a plurality of user devices.

Abstract: Described herein is an apparatus mitigating splash-back during the use of a conventional toilet while urinating. The apparatus uses a plurality of upstanding baffles that provide for a large target area mounted on a base with a central opening. Additionally, the baffles rotate into and out of operative configurations, relative to the inner-toilet surface, to allow the use of the toilet for solid waste. The baffles mitigate the effect of splash back as the urine stream makes contact with the baffles and reflects the droplets laterally. Additionally, droplets generated when the urine stream contacts either the base or pool of standing water is mitigated by the baffles intercepting the reflective path back to the user.

Abstract: Described herein is an apparatus mitigating splash-back during the use of a conventional toilet while urinating. The apparatus uses a plurality of upstanding baffles that provide for a large target area mounted on a base with a central opening. Additionally, the baffles rotate into and out of operative configurations, relative to the inner-toilet surface, to allow the use of the toilet for solid waste. The baffles mitigate the effect of splash back as the urine stream makes contact with the baffles and reflects the droplets laterally. Additionally, droplets generated when the urine stream contacts either the base or pool of standing water is mitigated by the baffles intercepting the reflective path back to the user.

Abstract: There is provided a method for use by a system. The method includes receiving live broadcasting of a segment of a video content from a live encoder; recording the segment in a video database of the non-transitory memory, receiving edits to the segment from a producer to produce an edited segment, encoding the edited segment to produce an encoded edited segment, and transmitting a network address of the encoded edited segment to a content management system (CMS) for distribution to a plurality of user devices.

Abstract: A munitions disabling device is disposed in a storage container proximate the muzzle of a single-use weapon. A projectile having a fused warhead is loaded in the weapon prior to storing the weapon. If an unplanned stimulus launches the projectile while the weapon is in the storage container, the projectile will impact or strike the disabling device. The disabling device prevents detonation or explosion of the warhead.

Abstract: A storage apparatus for a munition that contains energetic material uses a water-filled liner to absorb heat applied from the exterior of the storage apparatus. The liner is disposed between the munition and a metal storage container. The liner has segregated compartments which release water into either the storage container or the liner itself. The released water boils and forms steam. A spiral-shaped steam conduit is formed in either the wall of the storage container or in the liner itself. The steam conduit directs the steam away from the munition. The metal storage container includes a pressure relief valve to release the steam pressure. The storage apparatus delays the detonation of the energetic material in the munition.

Abstract: The present invention generally relates to online reputations. Specifically, this invention relates to a system and method for analyzing, determining, reporting and modifying an online reputation of a business, professional or individual. The online reputation of a business, professional or individual being comprised of a numeric value, calculated at least in part on positive reviews of the business, professional or individual, negative reviews of the business, professional or individual and the types of websites the positive or negative reviews reside upon.

Abstract: Systems and processes for displaying a graphical user interface control are described. API indicators may be displayed in response to a request for an API listing. A selection of an API indicator may be detected, the API indicator associated with one API of a plurality of APIs. A plurality of user interface control indicators may be displayed in response to the selection of the API indicator. The selection of a first user interface control indicator of the plurality of user interface control indicators may be detected, the first user interface control indicator associated with the graphical user interface control. The graphical user interface control may be compatible with the one API. An API call may be initiated using the one API. Response data may be received in response to the API call. The graphical user interface control may be displayed using at least a subset of the received response data.

Abstract: Systems and processes for providing an application development tool are disclosed. The application development tool may include a user interface that allows a user to select and modify widgets, map API properties to widget attributes, and create application user interfaces using the widgets. To modify the widgets and create applications, the application development tool may edit the source code associated with the widget or application based on input received from the user via the application development tool interface.

Abstract: The present invention generally relates to online reputations. Specifically, this invention relates to a system and method for analyzing, determining, reporting and modifying an online reputation of a business, professional or individual. The online reputation of a business, professional or individual being comprised of a numeric value, calculated at least in part on positive reviews of the business, professional or individual, negative reviews of the business, professional or individual and the types of websites the positive or negative reviews reside upon.