International Business Machines Corporation

Tandberg Telecom As

Trilogy Software, Inc.

James Joseph Babka

Chris Alan Schwendiman

Ryan Shillington

Matthew Sanchez

Dilum Ranatunga

Kurtis L Seebaldt

Alvin C Richardson

Kirk A Norsworthy

Razvan Surdulescu

Nikhil Raj Krishna

Jennifer W McKibben

An approach is provided that receives a change request from a requestor. The change request includes metadata regarding the change, one or more changes, and one or more change assumptions corresponding to at least one of the changes. The change request is stored in a data store of pending requests. One or more systems are identified that correspond to each of the change assumptions. The identified systems are automatically queried with queries that correspond to the change assumptions. Query responses in response to the querying are received from the identified systems. The validity of each of the change assumptions is determined based on the received query responses. If the change assumptions are valid, then the changes included in the change request are processed. On the other hand, if at least one of the change assumptions is invalid, then the change request is rejected.

Concurrent long spanning edit sessions using change lists with explicit assumptions

A method, computer program product, and system for accessing versioned data objects within a database, comprising creating a first new connection to a database stored in a memory, receiving a first query from a first client that requests access to a versioned data object stored in the database, and modifying the received first query to add contextual information configured on the first new connection, so that the modified first query is able to retrieve a first version of the versioned data object that corresponds to the contextual information.

Context-and-version-aware facade for database queries

A validation system is provided for validating the general structure of XML documents, for example ACORD documents, with a schema validation engine and a schema, for example an ACORD schema. A rules profile, containing a carrier's rules for ACORD documents, is set up and stored in storage. A rules engine further validates a received ACORD document with the rules contained in the rules profile. For efficient coding, the rules engine uses a combination of a scripting language (Groovy&#x2014;which is the standard scripting language for Java) and dot notation to describe exactly how the levels of the ACORD document are to be traversed, so that a single expression (that looks like a long variable name) is used to directly access the data in the document. A programmer simply writes a single long variable name that specifies exactly the data needed and makes that data available to use during validation.

Data validation rules for acord documents

Management information for plural video calls is presented through a user interface that displays a list of calls prioritized based on one or more parameters, such as alarms, so that the most important calls are prominently displayed as they need attention. An alarm tracker tracks alarms associated with video device parameters, such as jitter, latency and linearity, and an alarm priority module determines the priority of video calls for display by comparing the alarms associated with the video calls. In one embodiment, the user interface has a locking option to lock a call's display position, for instance when a particularly important call with a lesser number of alarms nonetheless has a need for closer monitoring.

Method and system for presenting a video call management console

When activities are operated in parallel, and there is only one status display, an ordered list is implemented with three methods of access: insertion at the top, removal from anywhere, and read of the top item. Items kept on this list are the status codes or words for the activities that are currently in progress. When a new activity begins, its status code or word is inserted at the top of the list. Whenever an activity completes, its code or word is removed from the list regardless of its location in the list, and in such a way as to preserve the order of the remaining entries in the list. Whenever the top entry in the list changes (whether through an insertion or removal), the single status display is updated to show the new top value.

Status display for parallel activities

The present invention discloses a system and method for reserving fractionally schedulable resources. The system includes a scheduling engine to receive reservation requests. The scheduling engine applies the reservation request to a resource usage table corresponding to a fractionally schedulable resource required by the reservation request. If the fractionally schedulable resource has adequate capacity to comply with the requested reservation, the scheduling engine will add the reservation request to a resource usage table.

System and method for fractional resource scheduling for video teleconferencing resources

A video network platform manages video network devices with management applications, such as scheduling, monitoring and diagnostics applications, by representing the devices as interface objects that support a network interface module, and application objects used by the management applications and created by an adapter engine that creates an application object for each corresponding video network device interface object. A network interface module associated with the video network platform invokes the adapter engine to create an application object associated with a device. The application object uses its dynamic attribute query capabilities to build an interface object in the network interface module and thus obtain device attributes such as device address information. The application module populates itself with device information for supporting management applications, thus allowing conventional network interface modules to cooperate with application specific objects.

System and method for managing diverse video network devices via application and interface objects

An element order independent comparison of hierarchically organized data structures may be performed efficiently using a transformation operation that orthogonally and recursively encodes child node information. In some implementations, a hash table is defined for which values are encoded as powers of two. Each value is therefore orthogonal when combined using simple binary addition. At any particular node, a concatenation of node-specific information with a sum of child-node hashes is, itself, hashed and associated with the node. Orthogonal encodings ensure that a combination (e.g., an additive combination) of values corresponding to elements of a sub-hierarchy is insensitive to ordering of the elements. Recursion can be employed to fold in information contributions at successive layers of an information hierarchy.

Growing community of inventors

Round Rock, TX, United States of America

James Joseph Babka