International Business Machines Corporation

Thomas Bitonti

Dana Lea Price

Wendell Jack Bouknight, Jr

Nabeel W Abdallah

Hans P Jerkewitz

Andrew Dwight Dingsor

Yang Lei

Dana Rieger Thalheimer

Wendell Jason Bouknight, Jr

James Alexander Hutton

A system for representing and generating XML data is provided. The system includes one or more processors and a mapping module configured to execute upon the one or more processors. The mapping module is configured to map each sparsely-encoded XML element of a sparse representation of a document into a complete, valid XML document. The system also includes a defaulting module configured to execute upon the one or more processors. The defaulting module is configured to generate at least one XML element missing in the sparse representation, but required to generate the complete, valid XML document.

Adaptive parsing of sparse XML data

A system for receiving local point of interest data is presented. The local point of interest data for a local geographic area is received by a geographic location device via a supported protocol. The local point of interest data includes information regarding one or more local points of interest in the local geographic area. The received local point of interest data is cached with existing point of interest data and maps within a cache in the geographic location device. Then, it is determined whether any time-sensitive point of interest data in the cache has expired. In response to determining that time-sensitive point of interest data in the cache has expired, the expired time-sensitive point of interest data is removed from the cache to form current local point of interest data for the local geographic area. Then, the current local point of interest data is displayed in a display device.

Local transmission of point of interest data to a global positioning system receiver

Mechanisms are provided to permit a first person (e.g., Tom) to be in a communication session (e.g., a chat session) with a second person (e.g., George) and to select a contact's name (e.g., Harry), and immediately set up another communication (e.g., a chat session) with the selected contact (e.g., Harry). Since there may be multiple contacts having the same name as the selected contact, e.g., 'Harry', mechanisms are provided to communicate with a desired person (e.g., 'Harry Smith' and not &#x201c;Harry Jones&#x201d;). The mechanisms may make such a determination based on &#x201c;Harry Smith&#x201d; being the more likely person that Tom, the first person, desires to communicate with (e.g., based on a context of Tom and/or Harry Smith).

Resolution of contact names

A Delta Framework program (DF) automatically detects and prevents breaking scenarios during an automated software build by identifying a build artifact from a list of build artifacts in a repository; comparing the build artifact to a current software build; identifying a delta between the build artifact and the current software build; determining whether the delta has a link to a rule in the rules database; responsive to the artifact having a link to a rule, determining whether the rule identifies a breaking scenario; responsive to the rule identifying the breaking scenario, taking an action specified by the rule.

Framework for delta analysis during automated builds

A method, system, and computer program product for reducing dependency calculation time in object persistence with circular referential integrity dependency is provided. The method includes building a graph using foreign key dependency from object to relational mapping, where nodes of the graph are object types and connected directionally from a source containing a foreign key to a target of a foreign key reference. The method further includes topologically sorting the graph to order dependencies among the nodes including circular dependences. The method also includes encapsulating the circular dependencies as a complex node. Furthermore, the method includes performing object dependency calculations on the nodes and the complex node in the graph. The results of the object dependency calculations are used to generate a sequence in which the objects can be modified in a relational database.

Methods, systems, and computer program products for using graphs to solve circular dependency in object persistence

A mechanism is provided for extending a Java archive file to include additional information that describes the contents of the archive as update information. A program is provided for determining differences between an initial file system tree and a final file system tree and encoding those differences into entries in a Java archive file. An extractor class is included in the Java archive file and named as the main class. The Java archive file may be transported to a site that needs a file system update. The Java archive file may be executed in a Java runtime environment to update a target file system. The extractor class is executed to decode and effectuate the difference entries in the archive file.

Growing community of inventors

Cary, NC, United States of America

Thomas Bitonti