International Business Machines Corporation

Samuel Jonathan Smith

Mark Andrew Woolley

John Colgrave

Manfred Georg Oevers

Andrew Wright

Oliver Masters

Alexander John Naylor

Steven J Horsman

Stephen John Burghard

Martin James Smithson

Andrew James Dunnings

Timothy Peter Griffith

Ian M Shore

Alexis Lee

Evan Garrick Jardine-Skinner

Aaron T R Gashi

Andrew Rutherford

William John Izard

Matthew James Ponsford

David Seager Renshaw

Bernard Z Kufluk

Michael Cobbett

Robert J Breeds

Philip Richard Taunton

Duncan George Clark

Raymond Jepson

David P George

Steven Groeger

Alexander John Naylor-Teece

Ian Derek Heritage

Dale Robinson Hewitt

Aaron Tomor Robert Gashi

Paul Andrew Duffin

Philip David Rowley

James Ronald Orchard

Tim Peter Griffith

Daniel Brook Sheard

Thomas G Hobbs

A method, computer system, and a computer program product for deploying a plurality of microservices across a service infrastructure having a plurality of resources is provided. The present invention may include determining at least one dependency of the plurality of microservices. The present invention may include for each resource of the plurality of resources, determining an outage distribution descriptive of an availability of the resource with respect to time. The present invention may include based on the outage distribution associated with each resource and the at least one dependency of the plurality of microservices, determining a deployment configuration of the plurality of microservices across the resources of the service infrastructure.

Deploying microservices across a service infrastructure

Disclosed is a method of location identification using a single beacon. The method comprises determining a first distance between a beacon and a first sensor, where the first sensor is embedded in a mobile device. It also includes determining a second distance between the beacon and a second sensor, where the second sensor is embedded in the mobile device. The method also includes defining a vector, where the vector has a magnitude equal to the distance between the first and second sensor, and a direction pointing from the first sensor to the second sensor. The method further includes calculating a plurality of potential locations. The method then determines the actual location.

Location detection using a single beacon

Processing a query for a database includes: receiving a portion of a query from a client device in a server implemented by at least one processor, the portion of the query comprising an incomplete component; determining that the incomplete component is one of multiple predefined types with the server; providing the incomplete component to an auto-complete function specific to the determined type of the incomplete component; receiving in the server a suggestion for completing the query from the auto-complete function, the suggestion being specific to the type of the incomplete component; and providing the suggestion from the server to the client device.

Complex query handling

Methods are provided for data processing in a multi-threaded processing arrangement. The methods include receiving a data processing task to be executed on data including a plurality of data records, the data having an associated record description including information relating to parameters or attributes of the plurality of data records. Based on the received data processing task, the record description is analyzed to determine an indication of expected workload for the data records. Further, the data is divided into a plurality of data sets. Based on the determined indication of expected workload for the data records, the data sets are allocated processing threads for parallel processing by a multi-threaded processing arrangement.

Data processing

An approach is provided in which the approach captures usage data corresponding to multiple users accessing a codebase that includes multiple code lines. The approach uses the captured usage data to compute a code line usage weighting for at least one of the code lines. The approach also computes a code line test coverage score for at least one code line based on at least one current software test program that tests the codebase. The approach compares the code line usage weighting against the code line test coverage score and flags the code line based on the comparison.

Traffic-based mutation/coverage testing requirements

A computer-implemented method for configuring deployment of a distributed system across a plurality of machines of a network. The method may include obtaining network information describing network communication characteristics between a plurality of machines of a network. The method may also include obtaining inter-container communication information describing at least one characteristic of communication between pairs of machines of the plurality of machines for a predetermined time period. The method may also include determining a cost function, the cost function mapping a potential container deployment configuration to an expected communication time, based on the network information and the inter-container communication. The method may also include processing the cost function with an optimization algorithm. The method may also include, in response to the processing, identifying a container deployment configuration having an associated cost that meets a cost requirement.

Distributed system deployment

A method of generating a sequence of commands to gather information using a directed tree graph includes providing a plurality of goals, each goal having a weighting, and a set of commands that lead to completion of the goals. A directed tree graph is constructed comprising a root node, respective leaf nodes associated with the goals, and one or more parent nodes. Each node is associated with one command, the command having the potential to complete any goals associated with the node and all the goals associated with any subordinate nodes. The priority of each command is determined, based on the sum of the goal weightings of leaf nodes subordinate to the node associated with the command. One or more commands is executed, a command having a higher priority being executed before a command having a lower priority.

Information gathering command generator

A method, computer system, and computer program product for using strain gauges to detect a state of a lock. The strain gauges may be disposed within a key or a key head sub-system. The key bank system may include receiving a first signal, comparing the first signal with first or second signatures, and determining state change of a lock when the first signal matches the first or second signal within a first or second threshold. The key bank system may include receiving a current state of the lock, where the state of the lock is the first state, and changing the current state of the lock to a second state, where the second state is opposite the first state. The current state of the lock may be displayed on a communication device and may be stored in a memory of a communication device or a memory of a server.

Lock status detection

The present arrangements relate to analyzing a software error. At least one dump file created in response to a crash of software executing on a processing system can be accessed. Based on the dump file, a base version of at least one software module that was loaded when the crash occurred can be identified. Based on the dump file, maintenance that has been applied to the at least one software module also can be identified. A report recommending new corrective maintenance to be applied to the at least one software module can be generated.

Correlation of source code with system dump information

Creating additional trace entries by dynamically processing recently captured output data, working data, and input data to diagnose a software error. Integrating additional trace entries in chronological order with conventional trace entries into a single trace dataset for analysis.

Creating trace data from recent software output and activity

This invention relates to query management. A query management method includes receiving a database query, generating an abstract syntax tree representation of the database path query into a set of java objects, and processing the abstract syntax tree representation of the database path query. The method further includes determining a selector upon processing the abstract syntax tree representation of the database path query and deriving a SELECT clause from the selector clause, where the SELECT clause indicates a portion of an expression from an XMeta Query Language (XMQL) query. The method yet further includes appending a FROM clause to the expression for the XMQL query, appending a WHERE clause to the expression for the XMQL query, and executing the expression for the XMQL query including the appended FROM clause and also the appended WHERE clause to access objects in an object repository.

Accessing objects in a service registry and repository

Growing community of inventors

Southampton, United Kingdom

Samuel Jonathan Smith