94 results about "Look-ahead" patented technology

A method and system for storing and retrieving data using a radix-search tree is disclosed. The method encorporates: (a) storing a plurality of nodes, each of the nodes having node-attributes, in a radix-search tree, and (b) retrieving the node-attributes of the plurality of nodes in single memory access. The system encorporates: (a) a data storage module for storing a plurality of sub-trees containing a plurality of nodes having node attributes, wherein the node attributes of at least one of the sub-trees are stored in a contiguous memory block, and (b) a processor that is operative to perform operations including: (i) transferring the node attributes of at least one of the sub-trees to the data storage module, and (ii) retrieving the node attributes of at least one of the sub-tree s from the data storage module.

State machines used to order and select matching operations for determining whether an input string matches any of at least one regular expression are configured by (1) accepting the set of regular expression(s), and (2) for each of the regular expression(s) of the set accepted, (A) identifying any look-ahead type strings within the given regular expression, (B) identifying any sequential type strings within the given regular expression, (C) partitioning the regular expression based on any identified simple strings, any identified look-ahead type variable strings, and any sequential type variable strings to generate partitioned parts of the given regular expression, (D) reordering the partitioned parts of the given regular expression using optimization policies to generate reordered partitioned parts of the regular expression, and (E) configuring nodes of a state machine corresponding to the given regular expression, by recording configured information of the nodes on a tangible storage medium, using (i) an order of the reordered partitioned parts of the regular expression, and (ii) a string type of the partitioned parts of the regular expression. Once configured, the state machines may accept an input string, and for each of the regular expression(s), check for a match between the input string accepted and the given regular expression using the configured nodes of the state machine corresponding to the given regular expression. Checking for a match between the input string accepted and the given regular expression using configured nodes of a state machine corresponding to the given regular expression by using the configured nodes of the state machine may include (1) checking detection events from a simple string detector, (2) submitting queries to identified modules of a variable string detector, and (3) receiving detection events from the identified modules of the variable string detector.

The invention discloses a dynamic adaptive speed look-ahead control method of continuous small line segment trajectories. The method comprises the steps that S1 the maximum speed of connecting points is calculated and the speed look-ahead number of segments is determined; S2 entering a deceleration area or not is judged, and the process jumps to the step S3 if the judgment result is no; S3 initial speed and end speed are compared; and the process jumps to the step S4 if the initial speed is greater than the end speed; S4 whether the deceleration distance constraint condition is met is judged; and the process jumps to the step S7 if the judgment result is yes, or the process jumps to the step S5; S5 whether the deceleration distance in which the initial speed reduces to the end speed is less than the current line segment displacement length is judged, and the process jumps to the step S7 if the judgment result is yes, or the process jumps to the step S6; S6 the maximum initial speed of the current segment displacement length constraint is searched and cycling is performed until tracing back to the look-ahead start point; S7 the non-look-ahead path is updated and whether the segment of the current line segment is less than the look-ahead number of segments is judged, and the process jumps to the step S2 if the judgment result is yes, or the process jumps to the step S8; and S8 speed look-ahead control is ended. High-speed connection of transition speed between the continuous trajectories can be effectively realized so that the processing time can be greatly shortened and the processing efficiency can be enhanced.

A system and method for implementation of look-ahead design methodology. Efficient debugging of a design is accomplished by evaluating the high level register transfer level (RTL) representation of a device being designed by quickly simulating the downstream implementation of that device to expose potential implementation problems that would otherwise be found much later in the design or manufacturing cycle.

The present invention provides methods and apparatus for adjusting an algorithmic time delay of a signal encoder. An input signal is sampled at a predetermined sampling rate. When look-ahead operation is initiated, the algorithmic time delay is increased by the look-ahead time duration. When look-ahead operation is terminated, the algorithmic time delay is decreased by the look-ahead time duration. A set of input signal samples is aligned in accordance with the algorithmic time delay, and an output signal that is representative of the set of signal samples is formed. A first signal segment is added to an input signal waveform when the look-ahead operation is initiated, and a second signal segment is removed from the input signal waveform when the look-ahead operation is terminated. Pointers that point to a beginning of the current frame and to new input signal samples are adjusted when the operational mode changes.

The invention discloses a numerical control system, a device with a storage function and a NURBS curve interpolation method. The NURBS curve interpolation method comprises: establishing a look-ahead buffer and storing buffer node data in the look-ahead buffer; and acquiring current insertion according to buffer node data and confirming the interpolation speed of a current interpolation cycle and performing NURBS curve interpolation through the interpolation point; determining whether an NURBS curve is finished interpolation or not, entering a next interpolation cycle if not. The invention notonly reduces the acquisition amount of an algorithm, but also reduces the acquisition amount of the algorithm by establishing a look-ahead buffer, thereby saving the curvature limit speed and the backward limit speed of the arc length interval by the forward buffer, and maintaining the look-ahead buffer according to the look-ahead buffer update method. The time overhead of each interpolation cyclealso ensures the real-time nature of the interpolation.

The invention discloses a corner transition smoothing method for smoothing axial jerk. The corner transition smoothing method comprises the following steps: designing a composite trigonometric function speed planning method; carrying out look-ahead initialization; constructing a corner transition curve, calculating axial kinematics trajectories on coordinate axes under axial speed limitation, corner section length limitation, contour error limitation, maximum feeding speed limitation and maximum axial acceleration limitation, and synthesizing the axial kinematics trajectories on the two coordinate axes to obtain the corner transition curve; and performing reverse scanning, and performing composite trigonometric function speed planning on all interpolation line segments forwards in sequencefrom the last small line segment. According to the method, a composite trigonometric function speed planning method is utilized, corner transition curve construction and uniaxial speed planning are completed at the same time within one step, the processing time consumed by motion trail control is remarkably shortened, smooth axial speed, axial acceleration and axial jerk control is achieved, andthe machining efficiency and the machining quality of the numerical control machine tool are improved.

The invention provides a continuous micro-line segment look-ahead control interpolation algorithm. The algorithm includes the following steps: calculating an actual interpolation distance s1 of a first micro-line segment; calculating an actual interpolation distance si-2 of a previous micro-line segment; through speed reachability determination of prospect optimization analysis, analyzing speed reachability between corresponding switch speeds of two ends (Pi-2 and Pi-1) of a (i-2) line segment; determining a speed segmenting point: if [alpha]i-3<[alpha]i-2 and [alpha]i-2=[alpha]i-1, needing to calculate the switch angle of the next point and conducting analysis, and if [alpha]i-2<[alpha]i-3, indicating that Pi-2 is not the speed segmenting point; if the speed segmenting point is not found, repeating the above 2-4 steps, and if the speed segmenting point is found, ending the look-ahead, and carrying out a look-ahead speed plan with the previous speed segmenting point being a starting point during the next look-ahead. According to the invention, the machining speed changes steadily, and the machining efficiency is greatly increased.

A speech recognition apparatus that performs frame synchronous beam search by using a language model score look-ahead value prevents the pruning of a correct answer hypothesis while suppressing an increase in the number of hypotheses. A language model score look-ahead value imparting device 108 is provided with a word dictionary 203 that defines a phoneme string of a word, a language model 202 that imparts a score of appearance easiness of a word, and a smoothing language model score look-ahead value calculation means 201. The smoothing language model score look-ahead value calculation means 201 obtains a language model score look-ahead value at each phoneme in the word from the phoneme string of the word defined by the word dictionary 203 and the language model score defined by the language model 202 so that the language model score look-ahead values are prevented from concentrating on the beginning of the word.

The invention discloses a redundant mechanical arm real-time look-ahead trajectory planning method based on an NURBS curve interpolation algorithm, and relates to the field of redundant mechanical arm application. According to the method, a tail end planning interpolation speed is obtained by giving a tail end target path point of the mechanical arm, constructing an NURBS parameter curve as a tail end expected path and adopting an acceleration and deceleration control algorithm, mechanical arm tail end path errors caused by interpolation are considered in a Cartesian space, the interpolation speed is limited according to bow height errors, a look-ahead algorithm is introduced, and the end planning interpolation speed is obtained. The interpolation speed is scaled by considering the joint speed and acceleration constraint of the mechanical arm, meanwhile, prediction of a deceleration point is achieved, NURBS curve interpolation is achieved through a pre-estimation correction method to obtain a tail end expected track, joint variables are solved through inverse kinematics, and joint limiting is achieved through redundancy characteristics and a gradient projection method. Real-time trajectory planning meeting the kinematics constraint condition of the mechanical arm is achieved, and the tail end trajectory tracking precision is guaranteed on the premise that the physical limit of the mechanical arm is not exceeded.

A method and apparatus for the implementation of reduced state sequence estimation is disclosed, with an increased throughput using precomputation (look-ahead), with only a linear increase in hardware complexity with respect to the look-ahead depth. The present invention limits the increase in hardware complexity by taking advantage of past decisions (or survivor symbols). The critical path of a conventional RSSE implementation is broken up into at least two smaller critical paths using pipeline registers. Various reduced state sequence estimation implementations are disclosed that employ one-step or multiple-step look-ahead techniques to process a signal received from a dispersive channel having a channel memory.

The disclosure presents processes to generate look ahead data to guide borehole operations, such as drilling operations. The processes can array collected resistivity data around a representation of an active borehole. The array can be in various patterns, such as an interleaved helix pattern. Each slice of data from the collected resistivity data can be positioned and oriented corresponding to the central point depth parameter for each slice of data. A selection of one or more card views can be enabled to display details of the collected resistivity data corresponding to the selected slice of data. An analysis of the resistivity data can generate an identification of a boundary, such as an object or a subterranean formation change, in the subterranean formation look ahead portion of the active borehole. The boundary identification can be used as inputs to a borehole operation plan or to a geo-steering system.