International Business Machines Corporation

Sap Se

Texas Instruments Corporation

Citrix Systems, Inc.

Linear Technology Corporation

Analog Devices,inc.

Zebra Technologies Corporation

Mukesh Kumar

Srinivasan S Muthuswamy

Subhendu Das

Rajesh Joshi

Willie Robert Patten, Jr

Ciaran J Brennan

Sudish Kumar Sah

Mohit V Gadkari

Srinivasa Raghavan V

Wayne Harvey Woods, Jr

Jeffrey G Hemmett

Avi Baum

Jasbir Singh Nayyar

Martin Haerterich

Knut Heusermann

Sreenath Narayanan Potty

Yi-Hui Ma

Barak Cherches

Thomas Vogt

Brandon Day

Vivek Singhal

Donnie Allen Smith, Jr

Kenneth L Greenlee

Steve W Fantaske

Stefan J Moeller

Matthias Becker

Shweta Shandilya

Guang Yang

Cole E Zemke

Blaine Jeffrey Gross

Torsten Buecheler

Olga Kreindlina

Santhosh N

Christian Hohmann

Anirudh Prasad

Dietmar Henkes

Oliver Berger

Steffen Witt

PankajKumar Agrawal

Sophie Kraut

Xenia Rieger

Thomas Koch

Walter Zimmermann

Marcus Echter

Albert Neumueller

Gaurav Kumar

Ben Gilboa

James Robert Dean

Namrata

Asaf Carmeli

Hemant Mangal

Bhavya Jha

Deepak Dundappa Khade

Seetharama Nayak

Rakesh Rachappanavar Chandrappa

Mandadapu Srilaxmi

Karthik Narayanan Mohan

Reo Lee

Kritesh Vasing

Venkatapathi Rao Kaka

Sahil Arora

Divya Arun Patil

Sunil Mohan Bhandarkar

Arpit Jaiswal

Pooja Ramarathnam

In an approach for detecting non-obvious relationships between entities from visual data sources, a processor calculates a co-occurrence frequency score for an entity pair from visual data. A processor calculates a distance proximity score for the entity pair from the visual data. A processor determines an event type in the visual data. A processor determines a timeline relationship in the visual data. A processor calculates a relationship score based on the co-occurrence frequency score, the distance proximity score, the event type, and the timeline relationship. A processor detects a relationship between the entity pair based on the relationship score.

Detecting non-obvious relationships between entities from visual data sources

The present disclosure involves systems, software, and computer implemented methods for automated message processing. Information associated with a failure message generated in response to process integration failure between two computer-implemented applications is received. The two computer-implemented applications include a sender application and a receiver application. The information includes a sender application/receiver application interface and details that caused the failure. Using the received information, multiple failure message similar to the failure message are identified. The identified messages were generated in response to the same process integration failure between the two computer-implemented applications. For either the sender or the receiver application, a resolution class operation executable to rectify the process integration failure is identified. The resolution class operation is simultaneously executed for all of the multiple failure messages.

Automated mass message processing

Aspects of the present disclosure relate to identifying and quantifying relationships between entities. Data sources can be queried to receive data regarding a party. Entities can be extracted from the data to receive a set of entities, wherein the party is a first entity of the set of entities. An ontological structure can be built that interrelates entities within the set of entities. An initial relationship strength can be determined between the first entity and a second entity based on co-occurrence between the first and second entities, wherein the second entity is a second party. A relationship score can be calculated between the first and second entities based on the initial relationship strength and at least one additional factor.

Relationship discovery and quantification

A computer-implemented method to automatically identify hotspots in a network graph. The method includes receiving, by a processor, input data, wherein the input data includes a plurality of messages, each message containing a set of message data. The method further includes generating, by a pattern detector, and based on the input data, a network graph, wherein the network graph includes a plurality of nodes. The method also includes determining a first risk indicator for each of the plurality of nodes. The method includes assigning a first weight to the first risk indicator for each of the plurality of nodes. The method further includes identifying a first hotspot in the plurality of nodes, wherein the first hotspot is based on the first weight of the first risk indicator of a first node. The method also includes outputting, by a network interface, the first hotspot and the network graph.

Automatic hotspot identification in network graphs

A computer-implemented system, method and computer program product for preparing alert reports that includes: receiving an override request to override an insight used to prepare the alert reports; determining, determining one or more execution pipelines used to prepare the alert reports that used the insight that is the subject of the override request; determining one or more impacted pipeline runs that were executed to prepare the alert reports that used the insight that is the subject of the override request; updating the one or more execution pipelines used to prepare the alert reports; and generating new alert reports, wherein generating the new alert reports comprises re-running the one or more impacted pipeline runs using the one or more updated execution pipelines wherein the insight that is the subject of the override request is overridden.

Override process in data analytics processing in risk networks

A computer-implemented system, platform, computer program product, tool, and/or method for re-running alert reports that includes: identifying an alert report to be rerun; collecting information on the alert report; gathering information on the configuration of a data analytics pipeline that generated the alert report; gathering data used to generate the alert report; recreating a regenerated data analytics pipeline based upon the information gathered on the configuration of the data analytics pipeline that generated the alert report; running the regenerated data analytics pipeline using the gathered data to create a rerun alert report; and optionally comparing the rerun to the original run including optionally generating a visual display of the results including in an aspect creating a side-by-side comparison of the tasks.

System and method to replay suspicious activity detection pipeline in risk networks

A method, system and computer program product for determining changes to database tables. In an embodiment, the method comprises loading a first group of records in a first time period in a database; loading a second group of records in a second time period in the database; selecting one or more of the records in the database; and for each of the selected records, determining whether it was loaded into the database during the first time period or the second time period, and providing the each record with a specified designation based on the time period during which the each record was loaded into the database. In an embodiment, identified times when the records were loaded in the database are used to determine the time period during which the each record was loaded in the database.

Determining additions, deletions and updates to database tables

In one aspect, there is provided a system including at least one data processor and at least one memory. The at least one memory may store instructions that cause operations when executed by the at least one data processor. The operations may include retrieving a schedule for a plurality of processes, the plurality of processes scheduled for multiple executions over a time period. The operations may further include generating a user interface configured to receive user input for scheduling a process of the plurality of processes, the user interface comprising one or more fields for scheduling the multiple executions. The operations may further restricting, by the processor, a quantity of scheduled executions for a process of the plurality of processes.

Background job scheduling restrictions

Computer-implemented systems and computer-implemented methods include the following. A request is received to perform a search for solutions corresponding to a topic. The request includes the topic and a context associated with the topic for which solutions are to be searched. The context is associated with a current state of an application in use by a user. The search is performed using the context and the topic. Results of the search are provided for presentation to the user. The results are presented in an application of the application without requiring the user to exit the application.

Search techniques using context

A method for gesture-based configuration of a data capture device includes: storing, in a memory connected to a processor, a plurality of configuration definitions each defining (i) a gesture, and (ii) a corresponding configuration parameter; at a processor, monitoring an input device for a configuration activation input; responsive to detection of the configuration activation input, activating a configuration control mode at the processor; responsive to activation of the configuration control mode, detecting an input gesture at the processor; selecting one of the configuration definitions defining the gesture that matches the input gesture; updating a current configuration of the data capture device with the corresponding configuration parameter of the selected configuration definition.

Method, system and apparatus for gesture-based configuration of paired scanner

A voltage regulator circuit having an internally compensated effective series resistance includes a control circuit to generate an out current at a regulated output voltage based on a reference voltage. The control circuit includes an amplifier, a resistive element to feedback output voltage to an input of the amplifier, and a compensation circuit to couple the internally compensated effective series resistance into the control circuit. The compensation circuit includes a first current sense device to generate a first sensed current proportional to a current through an N-type pass device, a second current sense device arranged to generate a second sensed current proportional to the current through the N-type pass device, and a bias circuit coupled to sink the first sensed current and the second sensed current to reduce a bias voltage across the resistive element below a threshold voltage.

Low dropout linear regulator with internally compensated effective series resistance

The present disclosure is directed to systems and methods for performing load balancing and message routing by a device intermediary to a plurality of short message peer to peer (SMPP) clients and a plurality of SMPP servers. The device can receive a request from an SMPP client to establish an SMPP session, replace a first sequence identifier in the request with a second sequence identifier generated by the device, and store a mapping of the second sequence identifier to the first sequence identifier. The device can select an SMPP server to forward the request with the second sequence identifier and receive a response from the SMPP server with the second sequence identifier. The device can identify, from the mapping, the first sequence identifier and the connection to the SMPP client using the second sequence identifier to forward the SMPP response with the first sequence identifier.

Systems and methods for performing load balancing and message routing for short message peer to peer protocol

According to one general aspect, a method may include replicating, to a software-as-a-service application, a plurality of pieces of master data from a physically remote master database. The method may also include converting the plurality of pieces of master data into one or more pieces of local data of the software-as-a-service application. The method may include changing one or more of either the pieces of master data or the pieces of local data. The method may further include synchronizing the changed pieces of either master data or local data between the remote master database and the software-as-a-service application.

Integration scenario for master data with software-as-a-service system

A maximum voltage selection circuit may include multiple inputs, each for receiving a different input voltage, an output for delivering the highest of the input voltages, and a voltage selection circuit. The voltage selection circuit may automatically select the input having the largest voltage magnitude, automatically deliver the voltage at the selected input to the output, and not draw quiescent operating current from any of the inputs. For each and every unique combination of two of the multiple inputs, the voltage selection circuit may include an enhancement mode FET with a channel connected in series between a first input of the unique combination of the two inputs and the output; a connection between the gate of the enhancement mode FET and the second input of the unique combination of the two inputs through the channel of a depletion mode FET; an additional enhancement mode FET with a channel connected in series between the second of the unique combination of the two inputs and the output; and a connection between the gate of the additional enhancement mode FET and the first of the unique combination of the two inputs through the channel of an additional depletion mode FET.

High voltage selector circuit with no quiescent current

Growing community of inventors

Bengaluru, India

Mukesh Kumar