International Business Machines Corporation

Hovey Raymond Strong

Jeffrey Thomas Kreulen

William Scott Spangler

Vikas Krishna

Ravi Mani

Joerg Meyer

Pratibha Jamdagneya Sharma

James J Rhodes

John Davis Palmer

Eliezer Upfal

Dharmendra S Modha

Divyesh Jadav

Pawan Raghunath Chowdhary

Jaishankar Moothedath Menon

Shun Jiang

Anca Andreea Chandra

James W Arendt

Deepak R Kenchammana-Hosekote

Richard Francis Freitas

Kenneth M Johns

Mario H Lichtsinn

Neelakantan Sundaresan

Steven Robert Hetzler

Ching-Yun Chao

Mu Qiao

Rama Kalyani T Akkiraju

Heiko Hary Ludwig

Robert John Moore

Taiga Nakamura

Sunhwan Lee

Nathalie Baracaldo Angel

Matthias Eichstaedt

Cynthia Dwork

Benjamin Clay Reed

Jeanette L Blomberg

Ching-Tien Ho

Debdoot Mukherjee

Clifford V Harris

Kevin Snow McCurley

Lei Huang

Benjamin G Shaw

Jayashree Ramanathan

Danny Dolev

Francis Daniel Lawlor

Susanne M Glissmann-Hochstein

Edward Leo Wimmers

Rodolfo Augusto Mancisidor

Larry Lee Proctor

Renjie Tang

Sami Nicole Rollins

Rudiger Karl Reischuk

Jakita Nicole Owensby Thomas

Frank Daniel Lawlor

Michael David Kistler

Ruoyi Zhou

Edward Robinson

Michael P Peercy

A computer-implemented method for time-based multiple automobile travel coordination. Aspects include creating a travel coordination group having at least two participants and obtaining a current position and a destination location for each of the at least two participants. Aspects also include determining an estimated travel time for each of the at least two participants based at least in part on the current position and the destination location for each of the at least two participants. Aspects further include coordinating travel plans for each of the at least two participants based at least in part on the estimated travel time of each of the at least two participants, wherein the coordination includes determining a departure time for each of the at least two participants such that each of the at least two participants will arrive at the destination location within a threshold amount of time from one another.

Time-based multiple automobile travel coordination

Embodiments of the present invention provide a method comprising maintaining historical meeting information, receiving an event data stream corresponding to a meeting, and delaying confirmation of an assignment of a meeting room for the meeting for a period of delay defined by a confirmation condition to predict a number of in-person attendees at the meeting based on the event data stream and the historical meeting information. The meeting room is tentatively assigned to the meeting based on the predicted number of in-person attendees. The method further comprises sending confirmation of the assignment of the meeting room for the meeting to at least one invitee only after the period of delay has elapsed.

Meeting room reservation system

One embodiment provides a method comprising intercepting a voice communication, collecting multi-sensory inputs associated with the voice communication, and determining an overall risk assessment metric for the voice communication based on the multi-sensory inputs and learned signatures. The multi-sensory inputs are indicative of content of the voice communication and one or more contextual factors associated with a target of the voice communication. The overall risk assessment metric indicates a likelihood the voice communication is a scam.

Conversation and context aware fraud and abuse prevention agent

Methods and arrangements for managing user access to a graph database. Nodes are represented in a graph, along with edges which interconnect the nodes. One or more facts are associated with each of the edges, and an access control list is provided with respect to one or more facts associated with one or more of the edges. There is restricted user access to one or more facts associated with the one or more of the edges, based on the access control list. Other variants and embodiments are broadly contemplated herein.

Edge access control in querying facts stored in graph databases

A method of summarizing a document includes a step of extracting one or more sections of the document. The method also includes a step of separating at least one of the one or more extracted sections into one or more subsections based at least in part on a conjunctive structure of the section, wherein each subsection comprises one or more terms. The method also includes steps of determining whether one or more terms within a designated set of terms are present within at least one of the one or more subsections and, responsive to a determination that one or more terms within the designated set of terms are present within at least one of the one or more subsections, removing the one or more terms from the one or more subsections. The method also includes a step of aggregating at least a portion of the one or more sections into a summary of the document.

Determining a purpose of a document

Embodiments of the invention relate to systematic migration of data. Data is streamed to data storage and stored in a virtual storage device (VSD). Stored data is systematically migrated from the VSD to a higher density VSD, while streaming of data is also switched to the higher density VSD. Source and target data extents are maintained and merged upon completion of the data migration, together with linking the streamed data blocks with the migrated data blocks in the order presented in the input stream.

Wait-free stream oriented migration based storage

Embodiments of the invention relate to reducing memory required to store an array of formulas and values corresponding to a formula-array. A set of formula-array representations is provided and arranged in a successive order. Each formula-array representation is evaluated for an associated memory requirement to support use thereof, followed by conversion to a structure of the formula-array representation at a successive level. Selection of the formula-array representation is determined based upon a minimal memory requirement from the formula-array representations in the order.

Object transformation of arrays of formulas and values

Systems and methods for transforming applications to provide uniform mechanisms for commenting on application objects, and mechanisms for collecting and processing feedback are described herein. An aspect provides for analyzing application code for at least one user action event handler associated with at least one object; and for modifying each at least one user action event handler located within the application code to contain at least one action configured to handle feedback for the associated at least one object; wherein invoking the at least one user action event handler triggers the at least one action configured to handle feedback. Other embodiments and aspects are also described herein.

Systems and methods for providing feedback for software components

A computer program product, including a computer readable storage medium to store a computer readable program, wherein the computer readable program, when executed by a processor within a computer, causes the computer to perform operations for moving data stored on a transactional semantic independent persister in a distributed environment. The operations include: receiving an indicator to move data stored by the persister at a first node of the distributed environment to a second node of the distributed environment, wherein the data corresponds to a source; and cloning the persister at the first node to a cloned persister at the second node in response to receiving the indicator, wherein the cloning includes: moving data stored by the persister at the first node to the cloned persister; and moving remaining data in a data stream between the source and the persister at the first node to the cloned persister.

Transactional independent persister cloning system

A method, system, and article for improving performance of a Boolean combination of at least two filters to a data stream. Stream processing is applied to an expression having two or more logical operators. As the data stream is processed, efficiency of the operators in the expression is evaluated. A sort algorithm is dynamically invoked to ensure that a more efficient operator precedes processing of a less efficient operator.

Method and apparatus for self optimizing data selection

A method, system, and article for automated processing of a data stream are provided. Stream processing is applied to a hierarchical self describing data stream. As the data stream is processed, some elements therein are associated with a selected path expression. The selected path expressions are ordered based upon the hierarchy, and a tree structure is created that corresponds to the hierarchy. Each leaf node of the tree is associated with a logical operator or an expression to be applied to data processed from the data stream to the leaf node.

Method and apparatus for automated processing of a data stream

Transforming a user-supplied DTD satisfying a first XML grammar into a PDTD satisfying a second XML grammar, including converting DTD declarations of alternate content to sequences, converting DTD declarations of optional content to mandatory content, converting DTD declarations of imbedded sequences to subsequences, and demoting attribute definitions of DTD elements having attributes to children of the DTD elements having attributes. Embodiments include converting recursions into repetitions, demoting imbedded compound repetitions from element declarations having imbedded compound repetitions, and demoting imbedded leaves from elements having imbedded leaves.

Tree construction for XML to XML document transformation

According to a preferred embodiment of the present invention, a bridging system () and method provides a way of linking two independent data systems by receiving a dataset from a source data system. The bridging system () translates the dataset from a source schema to a target schema according to a set of mapping rules, and queues the translated data in persistent storage, and then sends the translated dataset to a destination data system. The system () includes an XML bridge (), multiple application specific gateways (), and a web admin interface (), all in communication via a wide area network.

Method for allowing simple interoperation between backend database systems

A system, method, and computer readable medium for control and synchronization of data between collaborative database systems. These databases are not exact duplicates and in face involve locally private data. The data is shared at the discretion of a local database and can happen during times of low system or communication demand. The use of merging a particular text string into one of the database fields after data is sent between systems is used to tag the synchronization. No time stamps or similar dating is used. This enables no addition to the data fields that are in use between the database. Care is taken to assure timely and correct synchronization while not sending data that has already been sent.

System and method for eliminating duplicate copies of activity history logs in bridging two or more backend database systems

Graphical specification of an XML to XML transformation rule, including receiving a user's selection of a user-selected, optionally ambiguous, target leaf node, from a target tree of an initial target context, the target leaf node representing a target XML element to be mapped by the transformation rule; if the target leaf node is ambiguous, disambiguating the target leaf node; and adding the target leaf node to the transformation rule. Embodiments typically include receiving a user's selection of at least one user-selected, optionally ambiguous, source leaf node, from a source tree of an initial source context, wherein the source leaf node represents a source XML element to be mapped to the target leaf node by the transformation rule; if the source leaf node is ambiguous, disambiguating the source leaf node; and adding the user-selected source leaf node to the transformation rule.

Graphical specification of XML to XML transformation rules

Growing community of inventors

San Jose, CA, United States of America

Hovey Raymond Strong