Abstract: Data communication between a plurality of computer processes are tracked. The data communication between the plurality of computer processes are analyzed to classify relationships between the plurality of computer processes. Based at least in part on the classified relationships between the plurality of computer processes, an existence of a service provided by a functional group of computer processes included in the plurality of computer processes are automatically discovered. A visual map of the discovered service is generated.

Abstract: Data communication between a plurality of computer processes are tracked. Relationships between the plurality of computer processes are classified including by analyzing the data communication between the plurality of computer processes using a machine learning model. Based at least in part on the classified relationships between the plurality of computer processes, an existence of a service provided by a functional group of computer processes included in the plurality of computer processes are automatically discovered.

Abstract: A system and method track changes to a document and analyze the changes to the document against a set of predefined queries without re-analyzing the entire document. Hence, after a document has been processed in the system (i.e., had its terms matched against the set of predefined queries), only a small subset of the document needs to be reprocessed and analyzed after changes (i.e., edits) are made. The analysis of the small subset is accomplished by maintaining an incremental-results data set for each document. The incremental-results data set is much smaller than the actual document, only comprising a set of unique words found in a document. After a document is changed, only the words deleted or added to the changed portion are used to update the incremental-results data set.

Abstract: The present invention performs interpreted remote procedure calls. By utilizing an interpreter, the present invention saves significant storage within a data processing system that performs remote procedure calls. The interpreter of the present invention performs all marshaling and unmarshaling of arguments, thereby consolidating the marshaling and unmarshaling code within a single entity, the interpreter. In performing the marshaling and unmarshaling, the present invention utilizes a descriptor table which contains information pertaining to the argument stack of the remote procedures. By utilizing the present invention, stubs are no longer needed to be used with server side application programs and therefore redundant code and data are minimized throughout the system. However, the present invention also has the flexibility to use stubs with server side application programs where the stubs of the present invention contain a minimal amount of code to interact with the interpreter.

Abstract: A method and mechanism for for filtering incoming documents against user queries. A plurality of user queries including terms connected by logical operators is received. Terms and sub-expressions are combined into distinct sub-expressions and embedded into a directed acyclic graph (DAG) having a plurality of nodes. Each node in the DAG includes pointers to any successor nodes thereof, the terms in the queries are embedded as source nodes in the graph, and the operators embedded as internal nodes. When a document is received, the document is evaluated against the nodes in the DAG by comparing the relevant terms in the document with the source nodes in the DAG representative thereof. For each term that matches a source node, the internal successor node of the matched source node is evaluated based on the logical operator represented by the successor node and truth information of the predecessor nodes thereto, thereby determining a truth value of the internal successor node.

Abstract: A method of controlling the intercharacter spacing between adjacent characters in automatic typography systems. The method ensures that the autohinter creates even spacing between two adjacent characters as the resolution and font size varies. The left and right sidebearings of each character are hinted to one of a plurality of numbers of pixels to produce a hinted left sidebearing and a hinted right sidebearing. Next, a predetermined number of pixels are subtracted from one of the hinted sidebearings and added to the other of the hinted sidebearings. At font sizes less than a predetermined threshold, the plurality of numbers of pixels are such that the left and right sidebearings are hinted to a nearest integer plus one-half pixel, and at all font sizes greater than the predetermined threshold, the left and right sidebearings are hinted to a nearest integer.

Abstract: A method of hinting a font to provide improved stem width and intercharacter spacing control in automatic typography systems. The method is adapted to make the transition smoothly and gradually from the smallest font sizes to the largest font sizes. The stem widths and sidebearings of the font are measured and then clustered within a predetermined cluster tolerance parameter. Next, the clustered measurements are partitioned into a plurality of contiguous blocks and then hinted to one of a plurality of integer number of pixels. The number of blocks in the partition will vary depending on the given scaling factor, which is a function of the font size and the resolution of the output device on which the font is to be rendered.