Abstract: A system and method for implementing a privacy policy in an application to be run are provided. Definitions are received for a set of fields. At least one of the fields is designated as sensitive by a default privacy policy. A user is provided with a consent editor whereby the user can consent to relaxing the default privacy policy for at least one of the sensitive fields. A consent privacy rule is generated based on the received consent. A mapping aspect is provided which identifies joins at which code of the application is to be augmented by calling a minimization service to apply the default privacy policy by generating a minimized value of data in each of the designated sensitive fields used by the application unless there is a generated consent privacy rule which authorizes relaxation of the default privacy policy for the user's data in a respective sensitive field.

Abstract: A method for implementing a privacy policy includes receiving code for an application which includes definitions for a set of classes of records and for each of the record classes in the set, a definition of at least one field. A user selects one or more of the record classes and fields of the application as sensitive. A records manager is generated for identifying an associated minimization service for generating a minimized value of data in the sensitive field. A mapping aspect identifies joins in the application code where the minimization service is to be called. When the records manager and mapping aspect are deployed with the application, the minimization service generates a minimized value of data in the respective sensitive field.

Abstract: Data privacy is becoming increasingly important and, in some jurisdictions, required. Access to private data can be controlled by forcing all access to go through minimizations services that allow only authorized access to private data. These minimization services can become processing bottlenecks if the only way to modify private data is by way of requests to the minimization service. Certain homomorphic operations allow for encrypted data to be modified without being first decrypted although other operands must be encrypted. Augmenting a minimization service to provide a public encryption key provides for encryption of the other operands. Providing a records manager that can take advantage of homomorphic operations allows certain data operations to be performed without compromising security and without accessing the minimization service.

Abstract: A system and method for implementing a privacy policy in an application to be run are provided. Definitions are received for a set of fields. At least one of the fields is designated as sensitive by a default privacy policy. A user is provided with a consent editor whereby the user can consent to relaxing the default privacy policy for at least one of the sensitive fields. A consent privacy rule is generated based on the received consent. A mapping aspect is provided which identifies joins at which code of the application is to be augmented by calling a minimization service to apply the default privacy policy by generating a minimized value of data in each of the designated sensitive fields used by the application unless there is a generated consent privacy rule which authorizes relaxation of the default privacy policy for the user's data in a respective sensitive field.

Abstract: Data privacy is becoming increasingly important and, in some jurisdictions, required. Access to private data can be controlled by forcing all access to go through minimizations services that allow only authorized access to private data. These minimization services can become processing bottlenecks if the only way to modify private data is by way of requests to the minimization service. Certain homomorphic operations allow for encrypted data to be modified without being first decrypted although other operands must be encrypted. Augmenting a minimization service to provide a public encryption key provides for encryption of the other operands. Providing a records manager that can take advantage of homomorphic operations allows certain data operations to be performed without compromising security and without accessing the minimization service.

Abstract: A method for implementing a privacy policy includes receiving code for an application which includes definitions for a set of classes of records and for each of the record classes in the set, a definition of at least one field. A user selects one or more of the record classes and fields of the application as sensitive. A records manager is generated for identifying an associated minimization service for generating a minimized value of data in the sensitive field. A mapping aspect identifies joins in the application code where the minimization service is to be called. When the records manager and mapping aspect are deployed with the application, the minimization service generates a minimized value of data in the respective sensitive field.

Abstract: A computer-implemented business process deployment system and method are disclosed. The system includes memory which stores a design tool which receives a business process description and generates a deployment package composite based thereon. The business process description includes a set of business process activities for a business process, each of the business process activities in the set depending on abstract services for implementing the business process activity. An abstract bindings repository stores mappings between the abstract services and corresponding real services employed by an associated real service employing system. The deployment package composite is configured to bind the abstract service dependencies to the real services in the abstract bindings repository to generate a deployable business process composite that is deployable in the associated real service employing system. A processor implements the design tool.

Abstract: A document annotation system includes a graphical user interface used by an annotator to annotate documents. An active learning component trains an annotation model and proposes annotations to documents based on the annotation model. A request handler conveys annotation requests from the graphical user interface to the active learning component, conveys proposed annotations from the active learning component to the graphical user interface, and selectably conveys evaluation requests from the graphical user interface to a domain expert. During annotation, at least some low probability proposed annotations are presented to the annotator by the graphical user interface. The presented low probability proposed annotations enhance training of the annotation model by the active learning component.

Abstract: A computer-implemented business process deployment system and method are disclosed. The system includes memory which stores a design tool which receives a business process description and generates a deployment package composite based thereon. The business process description includes a set of business process activities for a business process, each of the business process activities in the set depending on abstract services for implementing the business process activity. An abstract bindings repository stores mappings between the abstract services and corresponding real services employed by an associated real service employing system. The deployment package composite is configured to bind the abstract service dependencies to the real services in the abstract bindings repository to generate a deployable business process composite that is deployable in the associated real service employing system. A processor implements the design tool.

Abstract: Systems and methods are described that facilitate validating electronic document conversion chain design in real time, as a designer edits a conversion chain that converts a document collection between formats. Waypoints are inserted into the document conversion chain by associating validation specifications with selected conversion components in the chain. AS the conversion chain is executed on a document collection, the validation specification is executed on all documents in the collection when a selected conversion component is executed. Validation results are returned to indicate to the designer which documents were successfully converted by the component and which were not. The designer can then modify the conversion chain, which is re-executed, and validation results are again presented to the designer for comparison to the pre-modification validation results. The designer can then approve or reject the modification(s) depending on whether document validation is improved thereby.

Abstract: In a document annotator (8), a document converter (12) is configured to convert a source document (10) with a layout to a deterministic format (14, 64) including content and layout metadata. At least one annotation pipeline (20, 22) is configured to generate document annotations respective to received content. A merger (36, 46) is configured to associate the generated document annotations with positional tags based on the layout metadata, which locate the document annotations in the layout. A document visualizer (58) is configured to render at least some content of the deterministic format and one or more selected annotations (60) in substantial conformance with the layout based on the layout metadata and the positional tags associated with the selected one or more annotations (60).

Abstract: Systems and methods are described that facilitate validating electronic document conversion chain design in real time, as a designer edits a conversion chain that converts a document collection between formats. Waypoints are inserted into the document conversion chain by associating validation specifications with selected conversion components in the chain. AS the conversion chain is executed on a document collection, the validation specification is executed on all documents in the collection when a selected conversion component is executed. Validation results are returned to indicate to the designer which documents were successfully converted by the component and which were not. The designer can then modify the conversion chain, which is re-executed, and validation results are again presented to the designer for comparison to the pre-modification validation results. The designer can then approve or reject the modification(s) depending on whether document validation is improved thereby.

Abstract: In a document annotator (8), a document converter (12) is configured to convert a source document (10) with a layout to a deterministic format (14, 64) including content and layout metadata. At least one annotation pipeline (20, 22) is configured to generate document annotations respective to received content. A merger (36, 46) is configured to associate the generated document annotations with positional tags based on the layout metadata, which locate the document annotations in the layout. A document visualizer (58) is configured to render at least some content of the deterministic format and one or more selected annotations (60) in substantial conformance with the layout based on the layout metadata and the positional tags associated with the selected one or more annotations (60).

Abstract: A document annotation system 10 includes a graphical user interface 22 used by an annotator 30 to annotate documents. An active learning component 24 trains an annotation model and proposes annotations to documents based on the annotation model. A request handler 26, 32, 34, 42 conveys annotation requests from the graphical user interface 22 to the active learning component 24, conveys proposed annotations from the active learning component 24 to the graphical user interface 22, and selectably conveys evaluation requests from the graphical user interface 22 to a domain expert 40. During annotation, at least some low probability proposed annotations are presented to the annotator 30 by the graphical user interface 22. The presented low probability proposed annotations enhance training of the annotation model by the active learning component 24.

Abstract: A system for integrating services in a system includes a plurality of services, wherein each service includes a software component associated with the system and provides at least one functionality. A user interface, such as a web browser, displays the plurality of services, wherein each service has a link associated with it for accessing the service directly. A scripting shell, responsive to selection of a first service and a second service from the plurality of services, pipes the first and second services together to form a scenario such that output from the first service is provided as input to the second service. A link may be associated with scenario for accessing the scenario directly.

Abstract: A system for integrating services in a system includes a plurality of services, wherein each service includes a software component associated with the system and provides at least one functionality. A user interface, such as a web browser, displays the plurality of services, wherein each service has a link associated with it for accessing the service directly. A scripting shell, responsive to selection of a first service and a second service from the plurality of services, pipes the first and second services together to form a scenario such that output from the first service is provided as input to the second service. A link may be associated with scenario for accessing the scenario directly.

Abstract: A process for analyzing deadlocks in an operating system of a machine uses a method which consists of searching, for any thread stopped on a lock, for the thread that holds that lock and when the thread itself is waiting for a lock, of going up the chain until a cycle is found. When the machine has a symmetrical multiprocessor and operates in a UNIX environment, this process makes iterative use of a specific function which makes it possible to go from one thread and from all the processors to any type of lock (active or passive waiting) by going through the threads one after the other to reconstruct a deadlock and hence a cycle, element by element. When a virtual memory is used such that all the necessary information is not in the physical memory, it also helps a user arrange all the chains provided by said process to reconstruct the cycle determining the deadlock.