Abstract: A system, method and computer program product for hand-drawing diagrams including text and non-text elements on a computing device are provided. The computing device has a processor and a non-transitory computer readable medium for detecting and recognizing hand-drawing diagram element input under control of the processor. Display of input diagram elements in interactive digital ink is performed on a display device associated with the computing device. One or more of the diagram elements are associated with one or more other of the diagram elements in accordance with a class and type of each diagram element. The diagram elements are re-displayed based on one or more interactions with the digital ink received and in accordance with the one or more associations.

Abstract: A system, method and computer program product for hand-drawing diagrams including text and non-text elements on a computing device are provided. The computing device has a processor and a non-transitory computer readable medium for detecting and recognizing hand-drawing diagram element input under control of the processor. Display of input diagram elements in interactive digital ink is performed on a display device associated with the computing device. One or more of the diagram elements are associated with one or more other of the diagram elements in accordance with a class and type of each diagram element. The diagram elements are re-displayed based on one or more interactions with the digital ink received and in accordance with the one or more associations.

Abstract: A system, method and computer program product for hand-drawing diagrams including text and non-text elements on a computing device are provided. The computing device has a processor and a non-transitory computer readable medium for detecting and recognizing hand-drawing diagram element input under control of the processor. Display of input diagram elements in interactive digital ink is performed on a display device associated with the computing device. One or more of the diagram elements are associated with one or more other of the diagram elements in accordance with a class and type of each diagram element. The diagram elements are re-displayed based on one or more interactions with the digital ink received and in accordance with the one or more associations.

Abstract: Disclosed are music symbol recognition apparatuses and methods that recognise music symbols from handwritten music notations. Various implementations may process handwritten music notations by segmenting the handwritten music notations into a plurality of elementary ink segments and then grouping the segments into graphical objects based on spatial relationships between the segments. One or more candidate music symbols may be determined for each graphical object, along with a symbol cost for each symbol, which represents a likelihood that the graphical object belongs to a predetermined class of symbols. The music symbol candidates may be parsed to form graphs based on grammar rules, and the graph most likely to represent the handwritten music notations may be selected for display or other use. The selection may be based on the symbol costs associated with each candidate and on spatial costs associated with the grammar rules that are applied to the candidates.

Abstract: A system, method and computer program product for hand-drawing diagrams including text and non-text elements on a computing device are provided. The computing device has a processor and a non-transitory computer readable medium for detecting and recognizing hand-drawing diagram element input under control of the processor. Display of input diagram elements in interactive digital ink is performed on a display device associated with the computing device. One or more of the diagram elements are associated with one or more other of the diagram elements in accordance with a class and type of each diagram element. The diagram elements are re-displayed based on one or more interactions with the digital ink received and in accordance with the one or more associations.

Abstract: Disclosed are music symbol recognition apparatuses and methods that recognise music symbols from handwritten music notations. Various implementations may process handwritten music notations by segmenting the handwritten music notations into a plurality of elementary ink segments and then grouping the segments into graphical objects based on spatial relationships between the segments. One or more candidate music symbols may be determined for each graphical object, along with a symbol cost for each symbol, which represents a likelihood that the graphical object belongs to a predetermined class of symbols. The music symbol candidates may be parsed to form graphs based on grammar rules, and the graph most likely to represent the handwritten music notations may be selected for display or other use. The selection may be based on the symbol costs associated with each candidate and on spatial costs associated with the grammar rules that are applied to the candidates.

Abstract: Disclosed are music symbol recognition apparatuses and methods that recognize music symbols from handwritten music notations. Various implementations may process handwritten music notations by segmenting the handwritten music notations into a plurality of elementary ink segments and then grouping the segments into graphical objects based on spatial relationships between the segments. One or more candidate music symbols may be determined for each graphical object, along with a symbol cost for each symbol, which represents a likelihood that the graphical object belongs to a predetermined class of symbols. The music symbol candidates may be parsed to form graphs based on grammar rules, and the graph most likely to represent the handwritten music notations may be selected for display or other use. The selection may be based on the symbol costs associated with each candidate and on spatial costs associated with the grammar rules that are applied to the candidates.

Abstract: Disclosed are music symbol recognition apparatuses and methods that recognise music symbols from handwritten music notations. Various implementations may process handwritten music notations by segmenting the handwritten music notations into a plurality of elementary ink segments and then grouping the segments into graphical objects based on spatial relationships between the segments. One or more candidate music symbols may be determined for each graphical object, along with a symbol cost for each symbol, which represents a likelihood that the graphical object belongs to a predetermined class of symbols. The music symbol candidates may be parsed to form graphs based on grammar rules, and the graph most likely to represent the handwritten music notations may be selected for display or other use. The selection may be based on the symbol costs associated with each candidate and on spatial costs associated with the grammar rules that are applied to the candidates.

Abstract: To selectively route stand-by packets in input modules to destination output modules via a switching matrix, distributed arbitration functions are executable by successive arbitration cycles. Each cycle comprises: a first phase executable by each input controller to send each output controller requests representative of the quantities of required stand-by packets; a second phase executable by each output controller to determine the quantity of admissible packets depending on the requests; a third phase executable by a central arbitration unit to determine allowed aggregate quantities depending on all the admissible quantities; and a fourth phase executable by each input controller to determine the allowed packet quantities depending on the admissible quantities and of the allowed aggregate quantities.

Abstract: In order to switch selectively via a packets switching matrix waiting in the input modules (IMi) to address output modules, an arbitration function (CSC) selects by successive cycles, from all the pairs of input and output modules, separate subsets. Each cycle comprises p successive phases (x) associated respectively to p arbitration functions. Processing units (PUi) each execute the p functions, each function acting on three parameters termed “residual required quantity”, “input capacity” and “output capacity”, the values of which are related to a single pair and are set at the start of the cycle. Each phase consists of N successive steps (y) associated respectively to said subsets, each step being executed in parallel by the processing units (PUi) in order to calculate by means of the arbitration functions the “partial” accepted quantity values and to reset the parameters for the next step. Application to telecommunication networks, particularly multiservice.

Abstract: In order to switch selectively via a packets switching matrix waiting in the input modules (IMi) to address output modules, an arbitration function (CSC) selects by successive cycles, from all the pairs of input and output modules, separate subsets. Each cycle comprises p successive phases (x) associated respectively to p arbitration functions. Processing units (PUi) each execute the p functions, each function acting on three parameters termed “residual required quantity”, “input capacity” and “output capacity”, the values of which are related to a single pair and are set at the start of the cycle. Each phase consists of N successive steps (y) associated respectively to said subsets, each step being executed in parallel by the processing units (PUi) in order to calculate by means of the arbitration functions the “partial” accepted quantity values and to reset the parameters for the next step. Application to telecommunication networks, particularly multiservice.

Abstract: To selectively route stand-by packets in input modules (IMi) to destination output modules (OMj) via a switching matrix (1), distributed arbitration functions are executable by successive arbitration cycles. Each cycle comprises: a first phase executable by each input controller (ICi) to send each output controller (OCj) requests representative of the quantities of “required” stand-by packets, a second phase executable by each output controller (OCj) to determine the quantity of “admissible” packets depending on the requests. a third phase executable by a central arbitration unit (CSC) to determine “allowed aggregate” quantities depending on all the admissible quantities. a fourth phase executable by each input controller (ICi) to determine the allowed packet quantities depending on the admissible quantities and of the allowed aggregate quantities.

Abstract: A system (10) for recognizing handwriting includes an input/output device (12) and a second computer (24 or 28). The system (10) converts handwritten symbols to text by using a grammar (50) that is comprised of the text (60) that is expected to be entered into a text display/text input area (17) of an input/output device (12). The grammar (50) and handwriting-to-text conversion can be performed in either the input/output device (12) or a remote computer (24, 28).

Abstract: A method is described for estimating the motion for image sequences carrying out a decimation of the function used for the extraction of the characteristic parameters of an image block. The method is iterated by decreasing the function decimation and carrying out the block-matching on a set of the best matchings of the preceding steps. The method does not require the recalculation of the parameters on the reference image for each block to be matched; moreover, in the extraction of the characteristic parameters of a block, the use of the Integral Projections is not mandatory but one of the possible variants only (FIG. 1).