International Business Machines Corporation

Nicholas E Bofferding

Michael C Hollinger

Andrew J Geissler

Adriana Kobylak

Balaji Venkata Atyam

Ajay Kumar Mahajan

Rashmi Narasimhan

Anis M Abdul

Ted M Pacyga

Omar Cardona

James Brian Cunningham

Binh K Hua

Sivarama K Kodukula

Kanisha Patel

Erlander Lo

Sivas Srr

Method and apparatus for incentivizing ride share users, where offers are presented to the users and based on selected offers, corresponding fares may be reduced. A ride share incentivization may include user profile database, a business database, a route generator, and an advertisement generator. The route generator is configured to generate a first route and a first fare based on a first ride share request, and a second route and a second fare based on a second ride share request. The advertisement generator may generate offers for the rider share users and adjust the fares of the ride share users based on the selected offers. The advertisement generator may further adjust one or more offers when no offers are selected.

Adjusting route parameters using a centralized server

An apparatus, method, and system for optimal device selection for streaming content are disclosed. One embodiment of an apparatus includes a stream query module that determines playback parameters of available streaming options for playing user-selected content. A playback environment module determines playback capabilities of connected playback devices and a playback environment of a user of the user-selected content. An analysis module performs a comparison of the available streaming options with the connected playback devices in the playback environment. A device optimization module determines an optimal playback device for playing the user-selected content in the playback environment using the comparison and the playback environment. A computer-implemented method and computer program product also perform the functions of the apparatus.

Optimal device selection for streaming content

A method for correcting improper repair actions in a computer system includes assigning a first algorithm identifier to a first algorithm and storing the first algorithm identifier and a first input to the first algorithm. The method includes executing the first algorithm with the first input and storing one or more results of the first algorithm, where the one or more results includes a repair action. The method includes determining that the repair action is faulty and storing the algorithm identifier for the first algorithm in a blacklist. The method also includes assigning a second algorithm identifier to a second algorithm and storing the second algorithm identifier and a second input to the second algorithm. The method includes executing the second algorithm with the second input, where the second algorithm corrects the faulty repair action caused by the first algorithm, and storing a result of the second algorithm.

Method and apparatus to rollback memory DIMM lane sparing

Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality for a software project, a source code of the first commit executable in a first system architecture, determining, based on a set of tests run against a built source code of the first commit for the first and second system architectures, that the first commit is a latest working build for the architectures, computing a score for each commit in a first set of the plurality, identifying a second commit of the first set of commits based on the scores for each commit, building the source code of the second commit for execution on the second system architecture, and determining that the source code of the second commit did not build successfully for the second system architecture based on an error at a first line of the source code.

Efficient detection of architecture related bugs during the porting process

Dynamic message selection and presentation based on integration of data from two or more applications is provided. Data from two or more applications on a first device is integrated utilizing an authentication token associated with the first device. Responsive to a real-time message request associated with an application, a data storage having one or more messages is interrogated. A first message from the interrogated data storage is selected and presented in real-time based on the message request, route traversal information from a first application, and profile data associated with a second application.

Local advertisement generation and display based on applications

A computer system may identify a source code for a program. The source code may include one or more instructions. The computer system may then receive a selection of two or more assessment metrics for evaluating the source code. The computer system may then generate an assessment score for each instruction in the source code based on the two or more assessment metrics. The computer system may then provide an assessment score indicator to for each instruction in the source code.

Analytic and layer-based augmentation of code reviews

Techniques are disclosed for identifying an optimal set of test cases of a larger test case bucket to execute on a new software release. The release includes one or more patches modifying development code of a previous release of the software, and each test case includes metadata specifying a history of the test case relative to an execution on the previous release. In each patch, it is determined, based on the metadata, whether at a test case targets the development code modified by the patch. Upon determining that the test case targets the development code, a score associated with the test case is incremented. The test cases are prioritized for execution based on score.

Focus area integration test heuristics

A computer-implemented method and system for assessing risk of a software program and software updates to a program to prioritize verification resources, which includes receiving code for a software product for a testing assessment. The code is analyzed according to a risk assessment criteria, and the risk assessment criteria includes risk assessment factors. The risk assessment factors for the code are weighted as part of the criteria. A risk assessment score of the code is determined based on the criteria. Testing resources are allocated in response to the risk assessment score.

Assessing risk of software commits to prioritize verification resources

Systems, methods, and computer program products to perform an operation comprising identifying a first commit of a plurality of commits for a software project, wherein a source code of the first commit is executable in a first system architecture, computing a score for each commit in a first set of the plurality of commits, wherein each score reflects a likelihood of success in porting the source code of the respective commit from the first system architecture to a second system architecture, wherein a version of each commit in the first set of commits is between a version of the first commit and a current version of the software project, identifying one or more of the first set of commits based on the scores for each commit, and building the source code of the one or more of the first set of commits for execution on the second system architecture.

Efficient detection of architecture related issues during the porting process

A mechanism, in a data processing system, is provided for logical partition defragmentation. The mechanism gathers resource requirements for a plurality of logical partitions running in a plurality of power domains within one or more servers. The mechanism determines optimal hardware utilization for the plurality of logical partitions. The mechanism migrates one or more of the plurality of logical partitions to run in a subset of the plurality of power domains such that at least one power domain within the plurality of power domains is unused. The mechanism puts the at least one unused power domain in a low power state.

Logical partition defragmentation within a data processing system

During an initial generation/assignment of location codes for field replaceable units (FRUs) that are and/or may be attached to the computer system, the service processor provides an alias location code for each FRU not currently attached. When the service processor later detects a concurrent install of the FRU, the service processor's firmware generates the correct location code from data retrieved from the FRU, and replaces the alias location code stored within the service processor's internal data structures with the correct location code. The firmware also forwards the correct location code back to a serviceability application, and the application utilizes the new location code in all remaining concurrent install commands to maintain a single, consistent view of the system.

Growing community of inventors

Cedar Park, TX, United States of America

Nicholas E Bofferding