Abstract: Several methods, and related apparatus, are provided for the entry of formatted ink data (i.e., electronic ink) such that individual items in the data may be parsed and recognized more effectively. Each method allows users to enter formatted ink data in-line, which can then be recognized with constraints and parsed for use in other application programs or databases. In addition, a method is provided for allowing user-specialization of any of these entry methods (or other similar) methods. Note that in any of these methods, the user may send the formatted ink either to the default ink-processing application, or else directly to another application or database.

Abstract: The system of the present invention includes a form design component, a form description repository, and a forms processing component Each form used with the system has a layout including a form identifier field with a common location space for each given form of the plurality of different types of forms.

Abstract: Several methods, and related apparatus, are provided for the entry of formatted ink data (i.e., electronic ink) such that individual items in the data may be parsed and recognized more effectively. Each method allows users to enter formatted ink data in-line, which can then be recognized with constraints and parsed for use in other application programs or databases. In addition, a method is provided for allowing user-specialization of any of these entry methods (or other similar) methods. Note that in any of these methods, the user may send the formatted ink either to the default ink-processing application, or else directly to another application or database.

Abstract: A compiler implemented method performs call-site specific selective automatic procedure integration over a program call graph. Individual call sites are selected for inlining based on two cost functions without the need for profiling. A routine cost function models each procedure and attempts to capture the cost of inlining a procedure. A call site cost function models the region around each call site, and attempts to capture the benefit of inlining or cloning a particular call site. Inlining is performed only at call sites for which both the routine cost function is less than a first threshold value and the call site cost function is less than a second threshold value.

Abstract: A computer implemented method performs flow-sensitive interprocedural data flow analysis without iteration for a class of interprocedural problems. The accuracy of the solution can approach the iterative result without the compile time cost. For interprocedural constant propagation (ICP), this method is more effective than existing methods and costs about the same compilation time. For flow-sensitive ICP over a program call graph (PCG), the method supports recursion while only performing one flow-sensitive analysis of each routine. If the PCG has cycles, a flow-insensitive solution is precomputed for constant propagation. During the flow-sensitive computation, the flow-insensitive result is used for a back edge. This permits a flow-sensitive solution to be obtained in one forward traversal of the PCG. This method can also be used to compute returned constants with one reverse traversal of the PCG.