Abstract: Disclosed herein is a bidirectional MR actuator comprising a first input member comprising a first rotor, an output member comprising a second rotor and a second input member comprising a housing having a non-magnetic portion and a magnetic portion. Each of the first input member and the output member are coupled to the second input member, the housing defining a chamber for accommodating the first rotor and the second rotor therein and further for receiving a quantity of MR fluid therewithin. The actuator further comprises a magnetic field generation assembly comprising a first coil assembly configured to selectively apply a magnetic field to a portion of the MR fluid between the first rotor and the second rotor, and a second coil assembly configured to selectively apply a magnetic field to a portion of the MR fluid between the second rotor and the magnetic portion of the housing.

Abstract: A process for generating regular expressions (regexes) as extraction patterns in a cluster computing system includes: receiving log events, a set of seed words, and a set of seed patterns; determining whether the set of seed words is full; if not, generating a new patterns by iteratively adding new patterns whose pattern scores S1 surpass a first preset score into the set of seed patterns; selecting a subset of seed patterns from the set of seed patterns; determining whether the subset of seed patterns is empty if not, generating a subset of seed words whose word scores S2 surpass a second preset score and iteratively adding the subset of seed words into the set of seed words; and repeating the above steps until the set of seed patterns is full and the set of seed words is empty; and finally pruning the set of seed patterns.

Abstract: A cluster computing system and process for generating regular expressions (regexes) as extraction patterns from operational logs are disclosed which includes: receiving log events, a set of seed words, and a set of seed patterns; determining whether the set of seed patterns is full; if the set of seed patterns is not full, then generating a new set of seed patterns by iteratively adding the set of seed patterns; selecting a subset of seed words from the set of seed words; determining whether the subset of seed words is empty; if the subset of seed words is not empty, then generating a subset of seed words and iteratively adding the subset of seed words into the set of seed words; and repeating the above steps until the set of seed patterns is full and the set of seed words is empty, then pruning the set of seed patterns.