Abstract: In some implementations, the techniques described herein relate to a method including: (i) identifying, by a processor, an electronic message addressed to an inbox of a user that comprises a confirmation of a transaction involving a platform, (ii) searching, by the processor, for an additional electronic message addressed to the inbox indicating an alteration applicable to the transaction, (iii) causing display, by the processor, of a prompt informing the user of the alteration applicable to the transaction, (iv) composing, by a large language model (LLM) executed by the processor, a potential electronic message to an operator of the platform requesting the alteration be retroactively applied to the transaction, and (v) in response to receiving user input regarding the potential electronic message, sending, by the processor, a subsequent electronic message to the operator of the platform requesting the alteration be retroactively applied to the transaction.

Abstract: A technique is provided for determining a loss risk assessment score for a vehicle trip. The technique includes, at a vehicle, a computing device receiving first information indicative of operation of the vehicle. The technique also includes, at the vehicle, the computing device receiving second information indicative of an environment at a particular location and time. The computing device correlates the first information and the second information to generate a data set. The technique also includes determining a score for the vehicle trip based at least in part upon the generated data set.

Abstract: A technique is provided for determining a loss risk assessment score for a vehicle trip. The technique includes, at a vehicle, a computing device receiving first information indicative of operation of the vehicle. The technique also includes, at the vehicle, the computing device receiving second information indicative of an environment at a particular location and time. The computing device correlates the first information and the second information to generate a data set. The technique also includes determining a score for the vehicle trip based at least in part upon the generated data set.

Abstract: A technique is provided for determining a loss risk assessment score for a vehicle trip. The technique includes, at a vehicle, a computing device receiving first information indicative of operation of the vehicle. The technique also includes, at the vehicle, the computing device receiving second information indicative of an environment at a particular location and time. The computing device correlates the first information and the second information to generate a data set. The technique also includes determining a score for the vehicle trip based at least in part upon the generated data set.

Abstract: A technique is provided for determining a loss risk assessment score for a vehicle trip. The technique includes, at a vehicle, a computing device receiving first information indicative of operation of the vehicle. The technique also includes, at the vehicle, the computing device receiving second information indicative of an environment at a particular location and time. The computing device correlates the first information and the second information to generate a data set. The technique also includes determining a score for the vehicle trip based at least in part upon the generated data set.

Abstract: A portable device for washing and spin-drying laundry, comprising a cover and a bag body, wherein the cover is provided with a rotating disk, and a user can rotate the rotating disk through a grip provided on the rotating disk, so that the rotating disk is rotated relative to the cover. A storage bag is connected at the bottom of the rotating disk, which can be used to store the laundry to be washed. The bag body is mainly made of soft material and can be folded for storage. An opening is formed for the cover to be assembled. When the present disclosure is used, the laundry to be washed is first placed in the storage bag, then the storage bag can be connected to the cover, and finally the cover can be combined with the bag body. Thereafter, the user holds the grip to turn the rotating disk such that the storage bag rotates inside the bag body to perform the washing and spin-drying operations.

Abstract: A portable device for washing and spin-drying laundry, comprising a cover and a bag body, wherein the cover is provided with a rotating disk, and a user can rotate the rotating disk through a grip provided on the rotating disk, so that the rotating disk is rotated relative to the cover. A storage bag is connected at the bottom of the rotating disk, which can be used to store the laundry to be washed. The bag body is mainly made of soft material and can be folded for storage. An opening is formed for the cover to be assembled. When the present disclosure is used, the laundry to be washed is first placed in the storage bag, then the storage bag can be connected to the cover, and finally the cover can be combined with the bag body. Thereafter, the user holds the grip to turn the rotating disk such that the storage bag rotates inside the bag body to perform the washing and spin-drying operations.

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: 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: 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: 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: 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.