Abstract: Information defining a plurality of states, a plurality of transitions, an initial state, and a final state is received from a user. The user may also provide additional information including pre-conditions and post-conditions for one or more transitions. Context information including one or more context variables and context variable values is generated based on the information provided by the user. A first plurality of possible paths between the initial state and the final state is automatically identified, wherein each path traverses at least one state and at least one transition. A second plurality of paths is identified from among the plurality of paths, based on the context information and the pre-conditions defined by the user. A Q-value is determined for each path in the second plurality of paths, using the rewards. A path having a highest Q-value is selected and presented to the user as a BPM. An acceptance or rejection of the proposed BPM is received from the user.

Abstract: The present invention concerns the nose-piece of a laser-beam drilling head for a drilling machine, emitting a pulsed laser beam, where the drill head includes a resource which is suitable for mounting the nose-piece, where the nose-piece includes a first laser beam entry opening and a second pulsed laser beam exit opening and a beam focussing resource arranged upstream of the second opening, characterised by the fact that a mirror is positioned in the optical path of the laser beam downstream of the said beam-forming resource, so that the emerging beam forms an angle of less than 180° with the entering beam, and where the nose-piece includes a laser-beam fluid assisting feed that is arranged so that the said fluid is emitted via the second opening in the direction of the laser beam.

Abstract: A Trie-type associative memory is used for an analysis of binary strings situated at defined locations of data packets. An analysis tree is established, which comprises stages associated with the locations, and paths each arriving at an action attributed on the basis of the values of the binary strings read from a data packet. The tree is then transcribed into the Trie memory.

Abstract: Different portions of a header of each packet containing protocol data are analyzed in succession from different gate registers of the TRIE memory. As a packet arrives, its header is stored in a buffer memory and a first portion of the stored header is analyzed. Each analysis of a portion of header produces either the forwarding reference associated with the packet or an intermediate reference containing a first code, making it possible to locate at an arbitrary location of the buffer memory a next portion to be analyzed, and a second code, making it possible to locate at an arbitrary location of the TRIE memory a gate register from which this next portion is to be analyzed. Having analyzed the first portion of a stored header, the subsequent portions thereof are analyzed in accordance with the first and second codes contained in the intermediate references produced in succession until the forwarding reference is produced.

Abstract: A Trie-type associative memory is used for an analysis of binary strings situated at defined locations of data packets. An analysis tree is established, which comprises stages associated with the locations, and paths each arriving at an action attributed on the basis of the values of the binary strings read from a data packet. The tree is then transcribed into the Trie memory.

Abstract: An associative memory of the TRIE type is organised in the form of registers of 2K cells having a portal register from which binary strings are analyzed in successive slices of K bits. Each non-empty cell contains either a pointer or a reference. This reference is issued after the analysis has followed a path formed by the cells designated by the successive slices of K bits in the registers designated by the pointers encountered in these cells in succession. The data is stored in the TRIE memory in response to commands to insert and delete binary patterns of variable length, each associated with a reference, so that when a bit string is analyzed, the reference issued is that associated with the longest of the binary patterns coinciding with the start of the string being analyzed.