International Business Machines Corporation

Sesame Workshop

James P Gray

Diane Phylis Pozefsky

John E Drake, Jr

Lee M Rafalow

Andrew P Citron

Alan E Baratz

Tamer E Abuelsaad

Satyanarayana Venkata Nitta

Mohammad Peyravian

Prasenjit Dey

Kathryn Heninger Britton

Mark Pozefsky

Jeffrey G Knauth

Emily Reardon

Miles Ludwig

Marsha E Ferree

Melinda R Pollard

David Louis Kaminsky

Ravindranath Kokku

Andrew Hilliard Arrowood

Raif O Onvural

Barbara A Maslak

Raymond F Bird

Aditya Sinha

Jodi M Cutler

John L Eisenbies

James John Martin

Kathryn E Clarke

George A Grover

Karla J Norsworthy

Timothy J Thatcher

Nick Bartzokas

Michelle Newman-Kaplan

Allison C Allain

Soumitra Sarkar

Stephen M Matyas

Marcia Lambert Peters

Robert S Cahn

James M Mathewson, Ii

Joshua S Auerbach

Richard Adam King

Harold D Dykeman

Inder Sarat Gopal

Richard Dean Telford

John H Wilson

Willibald A Doeringer

Guy Platel

Zhiyong Li

Allan K Edwards

Geoffrey Alexander Cohen

Zvonimir Ordanic

Roger D Turner

Kevin Jeffay

Michael A Lerner

Gene Y Tsudik

Lawrence Edward Troan

Vachaspathi Peter Kompella

Johny Mathew

James L Ashton

William E Siddall

Tsipora P Barzilai

Frank Donelson Smith

Bharath K Kadaba

Yue T Yeung

Philip F Chimento, Jr

Michael F Gierlach

Terence Dale Smetanka

Robert T Gibbs

Robert A Weingarten

Jeffrey M Jaffe

Winston W Chung

Tein-Yaw D Chung

Ravi Kokku

Peter J Hansen

Jay H Benjamin

Royal C Hayward

Phillip Allan Stone

Frederick E McGriff

Matthew L Hess

Manoj V Kasichainula

Ellis L Miller

James B Kalmbach, Jr

Stuart W Pretzman

John E Fetvedt

Jean A Lorrain

John F Wilder

John C Broughton

John P O'Donnell

Winston W-K Chung

A combination of knowledge representation and retrieval, assessments and personalization for a tutoring platform that provides an automated phased word exposition method for vocabulary learning and enable learners to learn words (or any learning objective) with sufficient proficiency and without excessive repetition. The phased learning objective method implements a moving average model that models the learner across multiple dimensions (e.g. reading, listening, writing, speaking) such that the platform is confident of the learner's understanding, while using minimal assessment doses, and such that the understanding transfers across experiences. The method implemented provides for multiple learning and assessment activities for a learning objective and leverages the same learner model for each learning dimension. Each word of a word set passes through learning and assessment-only phases for statistically significant evidence of learning. The model derived from the phased word expansion can be shared across applications, toys and tangibles that learners interact with.

Phased word expansion for vocabulary learning

Personalized video interjections based on a learner model and a learning objective. A method for adding interjections to a video includes analyzing the content of a plurality of videos based on a set of learning objectives, selecting a video based on a learning objective, determining types of video interjections using an analytics engine that compares a learner model and the learning objective, determining a location for the video interjections using the analytics engine, generating a video interjection for each video interjection type and inserting the video interjections into the video at the determined locations.

Personalized video interjections based on learner model and learning objective

Personalized video interjections based on a learner model and a learning objective. A method for adding interjections to a video includes analyzing the content of a plurality of videos based on a set of learning objectives, generating and storing educational content metadata on a timeline for the videos, selecting a video based on a user specific learning objective, determining types of video interjections using an analytics engine that compares a user learner model, the user learning objective and the metadata, determining a location for the video interjections using the analytics engine that compares the user learner model, the learning objective, the metadata and timeline, generating a video interjection for each video interjection type and inserting the video interjections into the video at the determined locations.

Methods, apparatus and computer program products are provided for distributing communication packets over multiple concurrent parallel links between a first node and a second node in a communication network based upon link quality information for the links. By utilizing link quality information from the links, the rate at which packets are provided to the links may be made proportional to the quality of the link, and thus, the link's ability to transmit the packet. The rate at which packets are provided to links may be reduced when error rates on a link exceed a specified threshold and eliminated when error rates exceed a higher threshold. Alternatively, timing delays from errors on a link may be used to determine a delay factor for a link and packets scheduled to the links based on the link with the lowest delay. The present invention is particularly useful in High Performance Routing Multilink Transmission Groups.

Optimal link scheduling for multiple links

Objects including Java bytecodes are embedded in a 3270 datastream structured field. The 3270 datastream structured field, including the objects so embedded, are passed between a primary logical unit and a secondary logical unit that communicate with each other over a network using 3270 datastream architecture. An initialization protocol sends a Read Partition (Query) structured field from the primary logical unit to the secondary logical unit, to query whether the secondary logical unit supports Java. The secondary logical unit sends a Query Reply structured field to the primary logical unit in response to receipt of the Read Partition (Query) from the primary logical unit if the secondary logical unit supports Java. In response to receipt of the Query Reply structured field from the secondary logical unit, the 3270 datastream structured field including embedded objects such as Java bytecodes is passed between the primary logical unit and the secondary logical unit. The objects that are embedded in a 3270 datastream structured field may include Java bytecodes, images and audio. Spanning may be used to send objects that exceed structured field length limits. Accordingly, Java and other objects may be integrated with legacy 3270 applications, without requiring the rewriting of legacy applications, and allowing the use of the highly developed 3270 datastream architecture.

Integration of objects including Java bytecodes with legacy 3270 applications

Optimal link scheduling for multiple links by obtaining and utilizing link quality information

Methods, systems and computer program products are provided for automatically generating client/server applications from an application written to execute on a single processing system. The application has program classes and programmed methods associated with the objects. Each program class in the application is identified and the relationships between programmed methods in the classes is determined. The relationships between the programmed methods in the identified classes are then weighted based on the activity of the relationship. Similarly, each identified class in the application is also weighted based on the computing resources required by the identified class. The identified classes are then partitioned into client classes and server classes based on the weighted relationships between the programmed methods in the classes, the weight associated with each class and a computing topology associated with a target client processing system. The resulting client and server partition may then be used for code generation and distribution based on the capabilities of a requesting computer system.

Methods, systems and computer program products for generating

A flow control system for packet transmission networks is centered in the user applications supplying data to the network. Changes in control are responsive to changes in the transmission parameters of the network, measured in the network and transmitted to the user application. The user application specifies desired ranges of Quality of Service parameters and, when the measured network parameters fall outside of the desired range, the user application modifies the transmission strategy to match the available transmission parameters. Measurements of network parameters are made over a pre-selected observation period to average the values of the transmission parameters.

User controlled adaptive flow control for packet networks

To enhance the security provided by data encryption in a data communication network, the encryption/decryption keys are changed periodically at the source and destination nodes for an established connection. A destination node must know not only the value of any new key but also when to begin using that key to decrypt received data packets. Synchronization (making sure a data packet is decrypted using a decryption key correlated with the encryption key used to encrypt the same packet) is achieved by defining a single bit in each packet header as a key synchronization bit. As long as key synchronization bit value remains unchanged from one received packet to the next, a receiving node will continue to use the same decryption key it has been using. When a change in the key synchronization bit value is detected, the receiving node will begin using a previously-received, new decryption key.

Synchronization of encryption/decryption keys in a data communication

To enhance the security provided by data encryption in a data communication network, encryption/decryption keys are changed periodically at the source and destination nodes for an established connection. A destination node must know not only the value of any new key but also when to begin using that key to decrypt received data packets. Synchronization (making sure a data packet is decrypted using a decryption key correlated with the encryption key used to encrypt the same packet) is achieved through the use of marker cells, which are special purpose cells. When a source node decides to activate a new key, previously sent to and stored at the destination node, a marker cell is transmitted by the source node to the destination node. When the destination node recognizes the marker packet, it discards it and activates the previously received key for use in decrypting subsequently received packets.

Use of marker packets for synchronization of encryption/decryption keys

The security provided by encryption of ATM cells is enhanced by testing each cell for low data content level. If a cell has a low data content, its contents are nevertheless compressed and the resulting string is used to replace the original data. A length character and a randomly generated number which are added to the freed-up byte positions in the data field of the cell. The entire, modified data field is encrypted before the cell is transmitted. At a receiving system, a compression indicator is checked to determine whether the cell contains original or compressed data. If necessary, the length field and the random number are stripped and the remaining cell data is decompressed before the cell data is decrypted.

Encryption of low data content ATM cells

A computer system and process efficiently provides resource recovery for a failure during a commit procedure. An application is run on a processor and requests a work operation involving a resource such as a protected conversation with another application in a different real machine. A commit procedure is begun for the work request, and if the commit procedure fails before completion, the following steps are taken to optimize the use of one or both of the applications. At some time after the commit procedure fails, a return code is sent to at least the application that initiated the commit indicating the result of the application commit order and that the application can continue to run and does not have to wait for resynchronization (recovery). Then, while the initiating application continues to run and do other useful work, resynchronization is implemented in parallel, asynchronously.

Asynchronous resynchronization of a commit procedure

A method and system for establishing multiple parallel conversations between a single pair of instances corresponding to a pair of communicating transaction programs over a data communication network. Each conversation traverses the network between the two communicating transaction program instances over a corresponding logical unit-logical unit session. Each conversation may be independently disconnected or reconnected without the need for invoking additional instances of the communicating transaction programs.

System for establishing and performing multiple conversations

A transaction network in which, in appropriate cases, a transaction is allowed to complete at each node and new work to commence, before all transaction resources at the node actually complete a syncpoint operation. This desirable result is obtained without the risk of unreported database corruption. At each node in response to a prepare to commit syncpoint command from a parent node, the node in question determines if it or any of its descendant nodes can make a unilateral heuristic decision to commit or backout the transaction irrespective of whether or not the final syncpoint command is to commit or backout. Each node informs its parent node that it is reliable or unreliable. Reliable means that neither this node nor any of its descendant nodes can make a unilateral heuristic decision. Unreliable means that this node or one or more of the descendant nodes may make such a unilateral decision. If a node is reliable, the transaction is released at the node after receiving and propagating to descendant nodes the final commit or backout command and before completion or acknowledgement of completion of the commit or backout command by the node or any of its descendant nodes. If the node is unreliable, then it waits for acknowledgement of completion of the commit or backout syncpoint operation at all unreliable nodes, including itself, before releasing the transaction at the node.

Method and apparatus for improving database reliability and response

Growing community of inventors

Chapel Hill, NC, United States of America

James P Gray