US Pat. No. 10,395,101

INTEREST DEGREE DETERMINATION DEVICE, INTEREST DEGREE DETERMINATION METHOD, AND NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM

FUJITSU LIMITED, Kawasak...

1. An interest degree determination device comprising:a memory; and
a processor that executes a process comprising:
detecting a gaze position of a user included in a plurality of users including a first user and a second user, on the basis of image data included on a plurality of frames that are consecutively captured by a camera that is so arranged that an imaging range of the camera includes the first user and the second user that gaze at gaze targets displayed;
storing, for each of the plurality of users, the detected gaze position that corresponds to a gaze target in association with a time of a frame in the plurality of frames on which the gaze position is detected in a first table within the memory;
obtaining a field of view of the user based on the detected gaze position;
determining, when determining that the gaze target of the first user and the gaze target of the second user who is present in the vicinity of the first user have been the same for a predetermined time based on the first table, whether the gaze position of the first user has been affected by the second user based on the obtained field of view of the first user and an action taken by the second user determined from the image data, wherein when the determining determines that the gaze position of the first user has been affected by the second user, a further determination is made that the first user is not spontaneously gazing at the gaze target; and
storing a determination result of the determining in association with the gaze position of the first user and a time of determination in a second table within the memory.

US Pat. No. 10,395,099

SYSTEMS, DEVICES, AND METHODS FOR THREE-DIMENSIONAL ANALYSIS OF EYEBAGS

1. A computer-implemented method of processing three-dimensional face scan data, the method comprising:applying a treatment to an eyebag area of a face;
receiving, by a facial analysis device, first face scan data representing a three-dimensional scan of the face;
determining, by the facial analysis device, a first model of an eyebag area of the first face scan data;
determining, by the facial analysis device, a first score based on the first model;
storing by the facial analysis device, the first score in a scan data store;
comparing, by the facial analysis device, the first model to at least one stored model of previous face scan data representing a previous three-dimensional scan of the face to determine differences between the models;
presenting, by the facial analysis device, the determined differences in order to evaluate the treatment; and
storing, by the facial analysis device, the determined differences in the scan data store.

US Pat. No. 10,395,098

METHOD OF EXTRACTING FEATURE OF IMAGE TO RECOGNIZE OBJECT

SAMSUNG ELECTRONICS CO., ...

1. A method of converting a vector corresponding to an input image, the method comprising:generating a projection matrix based on a covariance matrix corresponding to training vector data and a dictionary which is a set of elements constituting an object in an image, the generating including generating the projection matrix such that the projection matrix has a fixed rank;
receiving input vector data associated with the input image including the object;
converting the received input vector data into feature data based on the projection matrix having the fixed rank, wherein a first dimension of the input vector data is higher than a second dimension of the feature data; and
recognizing the object using the feature data converted from the received input vector data based on the projection matrix.

US Pat. No. 10,395,090

SYMBOL DETECTION FOR DESIRED IMAGE RECONSTRUCTION

MorphoTrak, LLC, Anaheim...

1. A computer-implemented method comprising:obtaining data indicating an image comprising a latent fingerprint and a template that surrounds the latent fingerprint, and
obtaining reference data that (i) identifies a known symbol associated with the template, and (ii) includes characteristics of the known symbol;
processing the image;
identifying, based on processing the image, one or more candidate regions of the image that are predicted to include the known symbol;
extracting image characteristics represented within the one or more candidate regions; and
determining, based on the characteristics of the known symbol and the extracted image characteristics represented within the one or more candidate regions, that the one or more candidate regions include the known symbol.

US Pat. No. 10,395,086

FLAT PANEL DISPLAY EMBEDDING OPTICAL IMAGING SENSOR

LG Display Co., Ltd., Se...

1. A flat panel display embedding an image sensor comprising:a display panel including a display area and a non-display area, the display panel having a top surface; and
a directional optical unit attached to the top surface of the display panel, the directional optical unit having a length along a length axis of the display panel, a width along a width axis of the display panel and a thickness along to a thickness axis of the display panel,
wherein the directional optical unit includes:
a cover plate having a size corresponding to the length and the width of the directional optical unit;
a light radiating film corresponding to the display area, the light radiating film positioned under the cover plate;
a light incident film positioned under the cover plate and disposed outside of the display area adjacent to a lateral side of the light radiating film;
a low refractive layer disposed under the light radiating film and the light incident film, the low refractive layer attached on the top surface of the display panel, and having a refractive index that is lower than a refractive index of the cover plate and that is lower than a refractive index of the light radiating film; and
a light source positioned under the light incident film,
wherein the directional optical unit provides a sensing light beam to the display area,
wherein the sensing light beam is collimated and directionized along a predetermined direction,
wherein the light source provides an incident light beam to an incident point on a surface of the light incident film,
wherein the light incident film has a first polarization axis along to a predetermined direction; and
wherein the light source provides an infrared light beam polarized in a second polarization axis which is parallel to the first polarization axis.

US Pat. No. 10,395,083

SYSTEM FOR COMMUNICATION FROM A USER TO THE PUBLISHER OF A SCANNABLE LABEL

1. A system for facilitating private communication between publishers and consumers, comprising: a secure remote server for facilitating secure communications over a public digital communication network; at least one publisher terminal integrated with a respective smartphone communication device including: an optical display for displaying a two dimensional code symbol in which is embedded a respective sequence of digital data including a digital identification code corresponding to a particular communication profile of a local particular publisher, and a publisher remote app for generating the two dimensional code symbol for a selected communication profile and for transmitting a corresponding unique identification code and related details of the corresponding communication profile to the secure remote digital server over a public digital network; and a plurality of consumer terminals, each integrated with a respective smartphone communication device which includes: an optical scanner for scanning the two dimensional code symbol displayed on the optical display of the publisher terminal to thereby produce a scanned code symbol, a consumer local app for converting the scanned code symbol into a corresponding two dimensional pattern of dots and for extracting therefrom the particular sequence of digital data embedded therein, and a consumer remote app for using extracted digital identification code data about the publisher and other private information about the consumer and the consumer terminal to establish secure two way communication with the publisher terminal via the remote digital server; wherein the code displayed by the publisher and scanned by the consumer includes sufficient encoded digital information to permit the consumer terminal to establish secure private communication with the publisher terminal via the digital server, without revealing to the consumer or the consumer terminal a network address of the publisher terminal or any other information designated private by the publisher, and without revealing to the publisher or the publisher terminal a network address of the consumer terminal or any other information designated private by the consumer.

US Pat. No. 10,395,080

SIMPLIFIED GATE STACK PROCESS TO IMPROVE DUAL CHANNEL CMOS PERFORMANCE

INTERNATIONAL BUSINESS MA...

1. A method of fabricating a semiconductor device, the method comprising:forming at least one of a first semiconductor region and a second semiconductor region different from the first semiconductor region, wherein forming at least one of the first semiconductor region and second semiconductor region comprises:
forming a first semiconductor channel comprising a first semiconductor material;
forming a first set of spacers extending from the top surface of the semiconductor channel so as to define a first gate between the first set of spacers;
depositing a fist sacrificial material between the first set of spacers, the sacrificial material comprising a combination of the first semiconductor material and an oxide material
annealing the first sacrificial material to form a first semiconductor-rich surface on a portion of the top surface of the semiconductor channel between the first set of spacers,
wherein the first gate includes a first high-k dielectric layer in contact with the spacers, and a first metal gate material in contact with the high-k dielectric layer.

US Pat. No. 10,395,079

SIMPLIFIED GATE STACK PROCESS TO IMPROVE DUAL CHANNEL CMOS PERFORMANCE

INTERNATIONAL BUSINESS MA...

1. A semiconductor device comprising:at least one of a first semiconductor region and a second semiconductor region different from the first semiconductor region, at least one of the first semiconductor region and second semiconductor region including:
a first semiconductor channel comprising a first semiconductor material;
a first set of spacers extending from the top surface of the semiconductor channel, wherein between the first set of spacers defines a first gate; and
an annealed semiconductor-rich surface on a portion of the top surface of the semiconductor channel between the first set of spacers, the annealed semiconductor-rich surface directly contacting the first gate,
wherein the first gate includes a first high-k dielectric layer in contact with the spacers, and a first metal gate material in contact with the high-k dielectric layer.

US Pat. No. 10,395,078

DIGITAL FINGERPRINT GENERATION USING SENSOR EMBEDDED PACKAGING ELEMENTS

International Business Ma...

1. A method for detecting package tampering, comprising:performing first scanning of a container comprising a packaged item and a plurality of packaging elements surrounding the packaged item;
wherein the plurality of packaging elements are integrated on a base material wrapped around the packaged item;
wherein each packaging element of the plurality of packaging elements is a cushioning element comprising a sensing component comprising a stress sensor;
wherein each stress sensor measures a stress value on a corresponding packaging element in one or more directions; and
wherein each sensing component wirelessly transmits one or more of the measured stress values to one or more scanning devices;
determining at least one stress on each of the plurality of packaging elements surrounding the packaged item from the first scanning;
performing second scanning of the container comprising the packaged item and the plurality of packaging elements surrounding the packaged item;
determining at least one stress on each of the plurality of packaging elements surrounding the packaged item from the second scanning; and
comparing the at least one stress on each of the plurality of packaging elements surrounding the packaged item from the first scanning with the at least one stress on each of the plurality of packaging elements surrounding the packaged item from the second scanning;
wherein the method is performed by at least one computer system comprising at least one memory and at least one processor coupled to the memory.

US Pat. No. 10,395,076

PROCESSES FOR DISTRIBUTION AND USE OF A MOBILE RFID CONTAINER

PROMEGA CORPORATION, Mad...

1. A system comprising:a mobile container configured to carry a plurality of items with a corresponding plurality of RFID tags inside the mobile container, wherein the mobile container includes:
an RFID detector configured to conduct at least one RFID scan and responsively generate scan data concerning the plurality of RFID tags;
location determining circuitry configured to determine location data corresponding to a current location of the mobile container;
a communications interface configured to wirelessly transmit the scan data and the location data; and
a door providing access to an interior region of the mobile container where the plurality of items with the corresponding plurality of RFID tags reside; and
an enterprise resource planning (“ERP”) system remote from the mobile container, wherein the ERP system is configured to:
communicate with the mobile container to receive the scan data and the location data;
determine whether the mobile container is within a geofence boundary of an end user based on the location data, at a distribution center, or in transit between the geofence boundary of the end user and the distribution center;
determine an identity of items removed from the mobile container while in the geofence boundary of the end user based on the scan data and the location data; and
determine restocking information for the mobile container based on the scan data before the mobile container arrives at the distribution center.

US Pat. No. 10,395,072

TAG BASED LOCATION

Rockwell Automation Techn...

1. An electronic device comprising:an augmented reality display that presents an image;
a processor;
a memory that stores code executable by the processor to perform:
identifying a given equipment tag within the image at a user focus determined using eye tracking at the augmented reality display; and
determining a device location based on the given equipment tag.

US Pat. No. 10,395,071

CONTROL OF RFID READER EMISSIONS WHICH MAY CAUSE INTERFERENCE WITH SYSTEMS USING RFID TAGS

AVERY DENNISON RETAIL INF...

1. A system for controlling an RFID emission within an environment including a sensitive object, comprising: an RFID reader configured to emit a reader signal; a host associated with the RFID reader and configured to define a signal strength of the reader signal; and a guard tag configured to receive the reader signal and, upon receiving the reader signal, emit a return signal to be received by the RFID reader, wherein the host is further configured to, upon the RFID reader receiving the return signal, decrease the signal strength and/or change a direction in which the reader signal is emitted; andwherein the guard tag includes a sensor configured to determine whether the sensitive object is active or inactive and, upon determining that the sensitive object is inactive, modify the return signal to prevent the host from decreasing the signal strength or changing the direction in which the reader signal is emitted upon the RFID reader receiving the return signal.

US Pat. No. 10,395,063

ZERO DETECTION CIRCUIT AND MASKED BOOLEAN OR CIRCUIT

Infineon Technologies AG,...

1. A zero detection circuit, comprisinga chain of masked OR circuits, wherein
each masked OR circuit of the chain of masked OR circuits comprises
a plurality of data inputs, wherein each data input is configured to receive
a respective data input bit,
at least one input mask input configured to receive one or more input masking bits,
at least one output mask input configured to receive an output masking bit and
a data output
and is configured to output a bit equal to an OR combination, masked with the output masking bit, of the data input bits, each demasked with an input masking bit of the one or more input masking bits, and
wherein one of the inputs of each masked OR circuit except the first masked OR circuit of the chain of masked OR circuits is coupled to the data output of the masked OR circuit preceding the masked OR circuit in the chain of masked OR circuits, and
wherein the data output of the last masked OR circuit of the chain of masked OR circuits forms an output of the zero detection circuit for outputting a zero detection result.

US Pat. No. 10,395,059

SYSTEM AND METHOD TO REDUCE A RISK OF RE-IDENTIFICATION OF TEXT DE-IDENTIFICATION TOOLS

PRIVACY ANALYTICS INC., ...

1. A computer-implemented method to reduce a risk of re-identification of personal information (PI) of a plurality of patients in a plurality of unstructured documents while preserving the PI and analytic quality and maintaining a justifiable low risk of re-identification in a data set, the method comprising the steps of:on a processor:
comparing a first sample of the plurality of unstructured documents annotated by a human authority to the first sample of the plurality of unstructured documents annotated by the computing device to determine metrics of leak rates indicating PI of one or more patients missed by the annotation by the computing device;
constructing one or more structured documents corresponding to the one or more patients missed by the annotation by the computing device;
determining a de-identification strategy to maximize analytic quality of the one or more structured documents and to maintains the risk of re-identification below a maximum acceptable risk threshold, wherein the de-identification strategy defines what PI is to suppress, perturb, and retain; and
applying the determined de-identification strategy to the plurality of unstructured documents by
retrieving a data set from a database communicatively coupled to the processor, the data set is selected to include the plurality of unstructured documents including patient medical records that meet a predetermined criteria;
identifying direct identifiers and quasi-identifiers in the data set;
calculating a first probability of re-identification from the direct identifiers and a second probability of re-identification from the quasi-direct identifiers;
perturbing the data set if one of the first probability or second probability exceeds a respective predetermined threshold, to produce a perturbed data set; and
providing the perturbed data set.

US Pat. No. 10,395,057

PROFILE MANAGEMENT

WELLS FARGO BANK, N.A., ...

1. A method for applying profile management that creates value mapping, comprising:enabling, by a system comprising a hardware processing unit,
application of rights management rules to a profile that is created by a first entity
wherein content of the profile is associated with a plurality of entities and the content includes personal information associated with the first entity, the content of the profile is segregated into portions that are based on the plurality of entities that provides the content, at least a subset of the rights management rules is based at least in part on an identity of one of the plurality of entities that provides content of at least a corresponding content portion, and types of rights are assigned based at least in part on the identity;
providing, by the system, social networking between the first entity and other entities of the plurality of entities;
collecting, by the system, additional content to update the profile;
establishing, based on search criteria, a mapping of personal goals from the personal information of the profile to the additional content, wherein the mapping comprises:
identifying the other entities from the collected additional content,
matching the identified other entities to the first entity based at least on the personal goals matching at least a part of the collected additional content,
identifying access rights of the other entities from the provided social networking,
identifying potential rights management rule changes to the profile based on the collected additional content and the identified access rights,
providing notifications to each of the identified other entities of the matching, and
enabling at least one of the first entity or the identified other entities to preview at least a respective matching profile;
wherein based upon receipt of a notification response to at least one of the identified other entities and based on the mapping, updating the profile and implementing the potential rights management rule changes; and
enabling the identified other entities to access the updated profile based on the identified access rights.

US Pat. No. 10,395,054

UPDATING DISTRIBUTED STORAGE NETWORK SOFTWARE

PURE STORAGE, INC., Moun...

1. A method of updating software in a dispersed storage network (DSN), where the DSN includes a plurality of dispersed storage (DS) units having respective software including one or more of operating system software, bootstrap firmware, application software, and software configuration information, the method comprising:identifying, by one DS unit of the plurality of DS units, a subset of other DS units of the plurality of DS units, wherein the one DS unit and the subset of other DS units comprise a set of DS units of the plurality of DS units that store encoded data slices associated with a storage vault, and wherein a decode threshold number of DS units is needed to reconstruct original data encoded in the encoded data slices;
determining, by the one DS unit, that a number of available DS units in the set of DS units is greater than the decode threshold number of DS units based on an update status of the set of DS units; and
updating, by the one DS unit, the respective software of the set of DS units, including the respective software of the one DS unit itself, while maintaining availability of the decode threshold number of DS units of the set of DS units to service access requests to the original data encoded in the encoded data slices.

US Pat. No. 10,395,053

METHOD FOR INHIBITING MASS CREDENTIAL THEFT

1. A method to represent access credentials, the method comprising:receiving a first access credential;
generating a random data bit string O with a bit count that is equal to the value of the first access credential, wherein the identities of the bits of the random data bit string O are randomly selected from any of the potential 2n permutations of bits, where n is the bit count of the random data bit string O;
providing the generated random bit string O to a party for use as an authentication credential;
storing a copy of the random data bit string O in an off-line file;
creating a data bit string Ot that has a Hamming distance oft from the random data bit string O (H(O, Ot)=t);
storing the data bit string Ot in a verifier; and
authenticating, by the verifier, a submitter of a received second access credential as the party that was provided the generated random bit string O if and only if the received second access credential has the Hamming distance of t from the stored data bit string Ot.

US Pat. No. 10,395,050

POLICY STORAGE USING SYNTAX GRAPHS

Oracle International Corp...

1. One or more non-transitory machine-readable media storing instructions that, when executed by one or more processors, cause:receiving a user-defined policy statement comprising a requestor variable value, an action variable value, a resource variable value, and a location variable value, wherein the user-defined policy statement describes an authorization policy for a requestor associated with the requestor variable value to perform an action associated with the action variable value on a resource associated with the resource variable value in a system location associated with the location variable value;
converting the user-defined policy statement to a canonical policy statement, wherein converting the user-defined policy statement comprises:
(a) mapping the requestor variable value to a unique system-wide requestor identifier, and
(b) mapping the location variable value to a unique system-wide location identifier;
generating a syntax graph of the canonical policy statement, wherein the syntax graph is traversable to determine whether the authorization policy is satisfied for a particular authorization request;
storing the syntax graph for use by an authorization service executing in a computer system;
traversing, by the authorization service, at least part of the syntax graph to determine whether the authorization policy is satisfied for the particular authorization request;
receiving a second user-defined policy statement;
converting the second user-defined policy statement to a second canonical policy statement;
generating a multi-policy syntax graph comprising the first canonical policy statement and the second canonical policy statement; and
storing the multi-policy syntax graph for use by the authorization service.

US Pat. No. 10,395,047

SYSTEM AND METHOD OF APPLYING MULTIPLE ADAPTIVE PRIVACY CONTROL LAYERS TO SINGLE-LAYERED MEDIA FILE TYPES

Entefy Inc., Palo Alto, ...

1. A non-transitory computer readable medium comprising computer executable instructions stored thereon that when executed cause one or more processing units to:receive an indication of a first protected portion and a second protected portion of a file of a single-layered, lossy file type having first dimensions, wherein the file further comprises anchor points;
receive first and second respective access permission settings for each of the first and second protected portions;
receive an indication of a first recipient for the first protected portion;
receive an indication of a second recipient for the second protected portion;
generate a first layer representation corresponding to the first protected portion and a second layer representation corresponding to the second protected portion;
generate an edited copy of the file based on the indication of the first and the second protected portions to create an edited single-layered, lossy file;
add the first and second layer representations back into the file structure of the edited single-layered, lossy file;
crop the edited single-layered, lossy file to have dimensions different from the first dimensions; and
transmit the cropped and edited single-layered, lossy file to the first and the second recipients,
wherein the anchor points are configured to align the first and second layer representations at the correct positions within the cropped and edited single-layered, lossy file when an authorized recipient views the cropped and edited single-layered, lossy file in an authorized viewing application.

US Pat. No. 10,395,046

WORK PROCESS MANAGEMENT SYSTEM, INDIVIDUAL CONTROLLER USED THEREIN, AND ACCESS RESTRICTION METHOD

OMRON Corporation, Kyoto...

1. A work process management system in an on-demand multi-product production environment, the system comprising:a work device comprising:
a work-device-side communicator comprising a first transmitter, a first receiver, and a first antenna, the work-device-side communicator configured to conduct external radio communication, and configured to transmit characteristic identification information;
a work part comprising a production machine configured to perform at least one work process on a work object;
a work-device-side control part comprising a first processor configured to perform operations comprising:
transmitting an access request to access associated information associated with a work content of the work process, or the work object through the work-device-side communicator, and
controlling the work process performed with the work part based on a reception result received in response to the access request and a command received through the work-device-side communicator, and
an individual controller attached to the work object, the individual controller controlling the work device, the individual controller comprising:
a second processor;
an individual-controller-side storage comprising a memory, in which the work content of the work process, the associated information, and access restriction information about the associated information are stored with respect to the work object;
an individual-controller-side communicator comprising a second transmitter, a second receiver, and a second antenna, the individual-controller-side communicator configured to perform external radio communication; and
an individual-controller-side calculation controller comprising the second processor, the second processor configured to perform operations comprising:
calculating a command value to be transmitted in the command for the work device to perform the work content of the work process, the command value calculated based on: a kind of the work device determined based on the characteristic information received from the work device; and the associated information associated with the work content of the work process, or the work object,
transmitting the command to the work-device-side communicator of the work device through the individual-controller-side communicator,
in response to receiving the access request to access the associated information from the work device through the individual-controller-side communicator, determining whether the access is permitted based on the access restriction information and the kind of the work device, and
transmitting the associated information to the work device through the individual-controller-side communicator only when permitting the access, wherein
the work device performs the work process based on the transmitted associated information and the transmitted command.

US Pat. No. 10,395,044

METHOD AND APPARATUS FOR SECURING COMPUTER MASS STORAGE DATA

Janus Technologies, Inc.,...

1. A system for securely storing computer system data comprising:a mass storage including a SATA device;
a host processor system including a SATA host, the host processor system executing an operating system and applications that produce and use data stored on the mass storage via the SATA host; and
a secure subsystem including a SATA complex, the secure subsystem being interposed between the SATA host of the host processor system and the SATA device of the mass storage,wherein the SATA complex includes a SATA device core that communicates with the SATA host of the host processor system when the operating system and applications are producing and using the data stored on the mass storage device.

US Pat. No. 10,395,030

BINARY SEARCH OF BYTE SEQUENCES USING INVERTED INDICES

CrowdStrike, Inc., Irvin...

9. A computer-implemented method comprising:for each byte sequence of a fixed length comprising a file, searching an inverted index which specifies byte sequences of the fixed length and, for each specified byte sequence, file identifiers of files that include the specified byte sequence;
identifying a subset of search results of the searching that are associated with the fewest numbers of file identifiers; and
constructing a fuzzy hash from byte sequences comprising the subset of the search results.

US Pat. No. 10,395,029

VIRTUAL SYSTEM AND METHOD WITH THREAT PROTECTION

FireEye, Inc., Milpitas,...

1. A computing device comprising:one or more hardware processors; and
a memory coupled to the one or more processors, the memory comprises one or more software components that, when executed by the one or more hardware processors, provide a virtualization software architecture including (i) a virtual machine, (ii) a plurality of hyper-processes and (iii) a hypervisor, wherein
the visual machine to operate in a guest environment and includes a process that is configured to monitor behaviors of data under analysis within the virtual machine,
the plurality of hyper-processes to operate in a host environment and isolated from each other within an address space of the memory, the plurality of hyper-processes include a threat protection process to classify the data under analysis as malicious or non-malicious based on the monitored behaviors and a guest monitor process configured to manage execution of the virtual machine and operate with the process to obtain and forward metadata associated with the monitored behaviors to the threat protection process, and
the hypervisor is configure to enforce temporal separation of the plurality of hyper-processes and enable inter-process communications between the plurality of hyper-processes.

US Pat. No. 10,395,024

AUTHENTICATION FOR ONLINE CONTENT USING AN ACCESS TOKEN

Adobe Inc., San Jose, CA...

1. A system comprising:one or more processors; and
one or more computer-readable storage device storing computer-executable instructions that, responsive to execution by the one or more processors, cause the system to perform operations including:
authenticating, at an online content resource, a client device for access to online content based on user credentials received from the client device as part of a request for access to the online content;
generating a message that includes the user credentials and a common access key held by multiple content resources that serve the online content;
creating an access token by hashing the message with the common access key to generate a first hashed message and by storing the first hashed message and an unhashed version of the message together as part of the access token;
communicating the access token and an instance of the online content to the client device;
removing, subsequent to the communicating, the access token and the message from the online content resource so that the access token is not stored by the online content resource;
receiving, subsequent to the removing, the access token as part of a subsequent request from the client device for access to the online content; and
authenticating the client device as permitted to access the online content as part of the subsequent request using the common access key and the access token and independent of any information about the client device stored by the online content resource by:
retrieving the first hashed message and the unhashed version of the message from the access token;
hashing the unhashed version of the message with the common access key to generate a second hashed message; and
ascertaining that the second hashed message matches the first hashed message retrieved from the access token.

US Pat. No. 10,395,023

AUTOMATED PASSWORD AUTHENTICATION

INTERNATIONAL BUSINESS MA...

1. A computer-implemented method comprising:monitoring an authentication request displayed on a screen and an authentication area drawn by a user, the drawn authentication area providing input, wherein the drawn authentication area encompasses a login area;
prompting the user to highlight the drawn authentication area that identifies the login area prior to entering information into the login area;
storing data that pairs screen buffer regions with authentication details;
and
outputting the authentication details in response to one of the screen buffer regions that correspond to the authentication details matching the drawn authentication area.

US Pat. No. 10,395,017

SELECTIVELY REDACTING DIGITAL FOOTPRINT INFORMATION IN ORDER TO IMPROVE COMPUTER DATA SECURITY

International Business Ma...

1. A computer-implemented method for protecting user privacy, the computer-implemented method comprising:retrieving, by one or more processors, a historical digital footprint of a user, wherein the historical digital footprint is a record of past digital data about the user that is available to a public, and wherein the historical digital footprint describes a pattern of routine activities related to social communications from the user;
generating, by one or more processors, a simulated digital footprint for the user, wherein the simulated digital footprint conforms to the pattern of routine activities related to the social communications from the user, and wherein the simulated digital footprint describes simulated current activities of the user;
transmitting, by one or more processors, the simulated digital footprint to the public while a current real digital footprint of real-time activities of the user is being created for the user, wherein use of the pattern of routine activities related to the social communications from the user provides an imperceptible transition from the historical digital footprint to the simulated digital footprint, and wherein the simulated digital footprint prevents the public from accessing the current real digital footprint of the user; and
adjusting, by one or more processors, the simulated digital footprint of the user to simulate a new routine of the user while at a second location, wherein the user is actually at a different first location.

US Pat. No. 10,395,015

MULTI-LEVEL MATRIX PASSWORDS

INTERNATIONAL BUSINESS MA...

1. A method comprising:traversing, during a password entry, a matrix to select a position, wherein the matrix comprises a plurality of levels, each level in the plurality of levels comprising at least one position where data can be entered, wherein a second level in the matrix forms a sub-level of a first level, and wherein the second level is reachable only from a particular position in the first level;
changing, responsive to an input, a mode of the selected position such that the position becomes unchangeable and unselectable during a remainder of the password entry;
encoding the selected position in an auth-step; and
transmitting, responsive to an indication of an end of the password entry, an auth-code, the auth-code comprising a set of auth-steps, the set of auth-steps including the auth-step.

US Pat. No. 10,395,012

MEDIA CLIENT DEVICE AUTHENTICATION USING HARDWARE ROOT OF TRUST

ERICSSON AB, Stockholm (...

1. A client device, comprising:at least one processor;
one-time-programmable (OTP) storage including a first verification key and one or more second verification keys; and
a computer-readable storage medium, coupled to the at least one processor, including:
a media client,
firmware,
a boot image including
a public encryption key securely stored in the boot image, and
an encrypted symmetric key, and
computer-readable instructions, when executed by the at least one processor, are configured to:
engage in a secure boot process to authenticate the boot image for use in a rights management scheme employing a private encryption key at a rights management server and the public encryption key by:
verifying a signature of the public encryption key using the first verification key,
decrypting the encrypted symmetric key to generate a decrypted symmetric key,
verifying a signature of the decrypted symmetric key using the one or more second verification keys, and
verifying a signature of the boot image using the decrypted symmetric key,
load and execute the firmware, responsive to successful completion of the secure boot process,
responsive to a request from the media client, use, by the firmware, the public encryption key to create an encrypted device registration message, and
return the encrypted device registration message to the media client, and
forward, by the media client, the encrypted device registration message to the rights management server to register the client device.

US Pat. No. 10,395,011

MONITORING LOCATION OF A CLIENT-SIDE DIGITAL CONTENT DELIVERY DEVICE TO PREVENT DIGITAL CONTENT MISUSE

Screening Room Media, Inc...

1. A method comprising:transmitting, by a client-side computing device, a request to a remote server to initiate presentation of a digital movie on a display device, the remote server facilitating presentation of multiple digital movies, the client-side computing device being associated with a first user account, the first user account including data identifying a geographic location of a dwelling associated with the first user account;
receiving, by the client-side computing device, a data stream of the digital movie and data identifying the geographic location of the dwelling associated with the first user account from a remote server, the remote server having accessed the data identifying the geographic location of the dwelling from the first user account;
initiating, by the client-side computing device, presentation of the digital movie on a display of the display device, the display device being different than the client-side computing device;
determining, by the client-side computing device, a current location of the client-side computing device;
determining, based on the current location of the client-side computing device and the data identifying the geographic location of the dwelling associated with the first user account, that the client-side computing device is outside of a predetermined radius from the geographic location of the dwelling associated with the first user account; and
in response to determining that the client-side computing device is outside of the predetermined radius from the geographic location of the dwelling associated with the first user account:
halting presentation of the digital movie on the display of the display device, and
scanning social media activity of a user associated with the client-side computing device for postings made by the user that indicate that the user is misusing the digital movie.

US Pat. No. 10,395,010

CLOUD-BASED BLOOD BANK COLLABORATIVE COMMUNICATION AND RECOMMENDATION

International Business Ma...

1. A method for providing cloud-based communication for blood bank collection and management, comprising:detecting a plurality of cloud systems;
registering the detected plurality of cloud systems based on a type of cloud system associated with the detected plurality of cloud systems;
enabling a plurality of cloud communications for the registered plurality of cloud systems, wherein enabling a plurality of cloud communications for the registered plurality of cloud systems comprises restricting user access to information associated with one or more cloud systems that are associated with the registered plurality of cloud systems based on the type of the cloud system;
enabling a blood bank cloud database, wherein the blood bank cloud database stores the information associated with the registered plurality of cloud systems, and wherein the information on the blood bank cloud database is restricted based on the type of the cloud system associated with the information;
receiving at least one blood donation request and at least one blood donation event using the enabled plurality of cloud communications for the registered plurality of cloud systems;
in response to receiving the at least one blood donation request, categorizing the at least one blood donation request based on information associated with the at least one blood donation request, and designating the at least one blood donation request for selected cloud administrators and users based on the categorization of the at least one blood donation request, wherein the categorization is based on a determination that there is sensitive information associated with the at least one blood donation request;
generating a plurality of lists of blood donors based on the at least one blood received donation request and the registered plurality of cloud systems; and
presenting to a plurality of users associated with the registered plurality of cloud systems, the generated at least one blood donation request based on the categorization and the received at least one blood donation event using the enabled plurality of cloud communications, wherein the plurality of users associated with the registered plurality of cloud systems are based on the generated plurality of lists of blood donors.

US Pat. No. 10,395,009

APPARATUS AND METHOD FOR COLLECTION OF PROTOCOL ADHERENCE DATA

Ai Cure Technologies LLC,...

1. A medication adherence monitoring system, comprising:a first storage device operable to store (i) one or more sets of video instructions and user prompts for encouraging proper performance of one or more predetermined movement sequences to be performed by a patient and (ii) additional video data comprising one or more videos of the one or more predetermined movement sequences, the one or more predetermined movement sequences being indicative of proper medication administration;
a display operable to display to the patient, one or more of the one or more sets of video instructions and user prompts for encouraging proper performance of the one or more predetermined movement sequences;
a video data capture device operable to capture at least video data of the patient performing one or more of the one or more predetermined movement sequences in response to the one or more of the one or more video instructions and user prompts;
a second storage device for storing the captured video data; and
a first processor operable to
output, to the display, a first type of alert that notifies the patient it is time to administer medication,
receive a patient medication administration initiation response following the output of the first type of alert,
output to the display, responsive to receiving the patient medication administration initiation response, the one or more of the one or more sets of video instructions and user prompts for encouraging proper performance of the one or more predetermined movement sequences,
receive the captured video data from the second storage device,
automatically compare the stored captured video data to the additional video data comprising the one or more videos of the one or more predetermined movement sequences,
determine, from the comparison, whether the patient has properly performed the predetermined movement sequences,
responsive to determining, from the comparison, that the patient has not properly performed the predetermined movement sequences, output, to the display, interactive feedback to the patient and an additional one or more of the one or more sets of video instructions and user prompts to further encourage proper performance of the one or more predetermined movement sequences.

US Pat. No. 10,395,008

DEVICE CONNECTIVITY ENGINE

Welch Allyn, Inc., Skane...

1. A single medical device, comprising:a physiological measurement device of the single medical device to capture data associated with vital signs; and
a computing device of the single medical device, comprising:
a device management engine configured to receive the data captured by the physiological measurement device, wherein the data captured by the physiological measurement device is formatted in a first data format;
a listener engine configured to determine a destination of the data sent by the single medical device; and
a device connectivity engine configured to:
transform the data captured by the physiological measurement device into an array of key-value pairs;
identify a template from a plurality of templates based upon the destination for the data;
populate the template with at least some values from the array of key-value pairs to generate a populated template, wherein the populated template includes at least a portion of the data captured by the physiological measurement device in a second data format; and
transmit the populated template from the single medical device to the destination.

US Pat. No. 10,395,004

HYPOTHESIS-DRIVEN, REAL-TIME ANALYSIS OF PHYSIOLOGICAL DATA STREAMS USING TEXTUAL REPRESENTATIONS

INTERNATIONAL BUSINESS MA...

1. A computer system, comprising:a decision support system, comprising:
an input/output port receiving physiological data associated with a patient having an unknown medical condition, said physiological data comprising streams of medical data obtained by monitoring said patient and medical symptoms reported by said patient; and
a processor operatively connected to said input/output port; and
an information retrieval system operatively connected to said decision support system, said information retrieval system comprising a corpus of data having structured and unstructured data in a relevant medical domain, said corpus of data being maintained in a separate database,
said processor:
automatically extracting numerical data from said physiological data based on development of said streams of medical data over a period of time,
automatically extracting features from said numerical data, said features comprising a property of said physiological data being observed,
automatically converting said features extracted from said physiological data into a textual representation using natural language generation, said natural language generation converting said features into words to use as input terms for said information retrieval system,
automatically generating a query for said information retrieval system using said input terms based on said textual representation and said medical symptoms reported by said patient, at least one said query being generated for each feature extracted from said physiological data, and
inputting said query to said information retrieval system,
said information retrieval system:
receiving said query, and
automatically searching said corpus of data and retrieving results to said query, said results indicating a possible medical condition of said patient in said period of time.

US Pat. No. 10,395,002

OPTICAL RULE CHECKING FOR DETECTING AT RISK STRUCTURES FOR OVERLAY ISSUES

INTERNATIONAL BUSINESS MA...

1. A method of performing lithography and detecting at risk structures due to a lithographic mask overlay comprising:performing a lithography process;
performing the lithographic mask overlay; and
the method of detecting being implemented in a computer infrastructure having computer executable code tangibly embodied on a computer readable storage medium having programming instructions operable to:
determine a probability that an arbitrary point (x, y) on a metal layer is covered by a via by calculating a statistical coverage area metric followed by a summing function; and
detect at risk structures of a semiconductor device by detecting a lithography error occurring from a misalignment of the lithography mask overlay during the lithography process in which the misalignment of the lithography mask overlay occurs when the metal layer is covered by the via based on the determined probability,
wherein determining the probability that the arbitrary point (x, y) on the metal layer is covered by the via comprises:
determining that the metal layer is inside the via by calculating:

wherein:
Pin is representative of a probability that the via covers the metal layer, at the arbitrary point;
determining that the metal layer is outside the via by calculating:

wherein:
Pout is representative of the probability that the via covers the metal layer, at the arbitrary point outside the nominal via shape; and
Ox and Oy follows Gaussian distributions to calculate for the Pin and Pout;
Rv represents the radius of the nominal via shape,
wherein the arbitrary point (x, y) is defined by an x coordinate and a y coordinate in a cartesian coordinate system,
wherein P is a probability, and Ox and Oy is an overlay in an x direction and a y direction, respectively, and
wherein the summing function includes mathematical approximations, and the mathematical approximations including engineering approximations to detect the at risk structures of overlay error.

US Pat. No. 10,395,001

MULTIPLE PATTERNING LAYOUT DECOMPOSITION CONSIDERING COMPLEX COLORING RULES

SYNOPSYS, INC., Mountain...

1. A computer implemented method for decomposing a layout of a portion of an integrated circuit, the layout including a first plurality of polygons, the method comprising:constructing, using the computer, a first matrix representative of a first plurality of constraints, each of the first plurality of constraints being between a different pair of the first plurality of polygons;
solving, using the computer, the first matrix to thereby assign one of a plurality of masks to each different one of the first plurality of polygons, when the computer is invoked to decompose the layout; and
characterizing the first matrix by a dimension equal to the sum of a first number and a second number, wherein the first number is equal to a first count of the first plurality of polygons multiplied by a second count of the plurality of masks, wherein the second number is equal to a third count of the first plurality of constraints multiplied by the second count.

US Pat. No. 10,394,999

ANALYSIS OF COUPLED NOISE FOR INTEGRATED CIRCUIT DESIGN

International Business Ma...

1. A computer-implemented method comprising:generating, by a processor coupled to the computer, an electronic representation of a circuit design based on the output of a Simulation Program with Integrated Circuit Emphasis (SPICE) for one or more variations of the circuit, derived from the described circuit as expressed in a hardware description language (HDL), or derived from actual data measured from one or more manufactured prototypes of the circuit;
identifying a noise cluster from within the circuit design;
representing said noise cluster according to a variational model, wherein the variational model supports variational analysis of a maximum and a minimum noise given asserted levels of pessimism, the maximum and the minimum noise are expressed through assumed and/or nominal values that are passed through the variational model to represent the noise cluster;
projecting said variational model onto one or more corners to yield a projected noise cluster; and
determining a computed noise for said projected noise cluster.

US Pat. No. 10,394,997

METHOD AND APPARATUS FOR RELOCATING DESIGN MODULES WHILE PRESERVING TIMING CLOSURE

Altera Corporation, San ...

1. A method, comprising:compiling a first circuit design;
performing a placement of the first circuit design on a programmable logic device at a first location;
performing an optimization of the placed first circuit design to generate a design optimization;
preserving the design optimization of the placed first circuit design after the optimization; and
applying the design optimization on a placed design of the first circuit design at a second location.

US Pat. No. 10,394,994

FIELD-EFFECT TRANSISTOR PLACEMENT OPTIMIZATION FOR IMPROVED LEAF CELL ROUTABILITY

INTERNATIONAL BUSINESS MA...

1. A computer program product for automatically generating a layout of a cell of a semiconductor circuit by minimizing a gate-to-gate net length of the cell, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to:read, by a processor, a netlist of the cell, the netlist including a description of internal electrical nets connecting electrical components of the cell with each other, wherein the program instructions are executable by the processor to cause the processor to;
assign, by the processor, an exclusive internal weight to at least one internal net of the internal electrical nets; and
place, by the processor, the electrical components in an area of the semiconductor circuit based on the netlist and the weight to generate the layout of the cell of the semiconductor circuit;
provide the layout of the cell to a production process for producing the semiconductor circuit,
wherein the weight corresponds to a probability that electrical components respective to the at least one internal net are placed close to each other,
wherein the program instructions are executable by the processor to cause the processor to assign a second weight to at least one external net that is lower than the weight of the at least one internal net,
wherein the program instructions are executable by the processor to cause the processor to place the electrical components, comprises optimizing a total internal net length of the cell, where a length of the at least one internal net is weighted according to the weight.

US Pat. No. 10,394,993

DISCRETIZING GATE SIZES DURING NUMERICAL SYNTHESIS

SYNOPSYS, INC., Mountain...

1. In an electronic design automation (EDA) software tool in a computer, a method for discretizing cell sizes during numerical synthesis, the method comprising:modeling, by using the EDA software tool in the computer, a numerical optimization problem based on a circuit design and numerical models of a first set of library cells;
solving the numerical optimization problem by using a numerical solver to obtain an optimal input capacitance value for an input of an optimizable cell in the circuit design;
identifying a first library cell in the first set of library cells whose input capacitance value is closest to the optimal input capacitance value;
computing a delay from an input of a driver cell to an output of the optimizable cell assuming the first library cell is instantiated at the optimizable cell; and
identifying a second library cell from a second set of library cells that includes all library cells in the first set of library cells and at least one additional library cell, wherein the input capacitance value of the second library cell is less than or equal to the input capacitance value of the first library cell, and wherein instantiating the second library cell at the optimizable cell would improve the delay from the input of the driver cell to the output of the optimizable cell.

US Pat. No. 10,394,990

INITIAL CONDITION SUPPORT FOR PARTIAL RECONFIGURATION

Altera Corporation, San ...

1. A method for initializing one or more registers of a programmable integrated circuit (IC) to store an initial condition value by emulating programmable initial conditions in the programmable IC without native support for the initial conditions, comprising:determining, via a compiler, whether at least a register of the one or more registers is not directly connected to at least a LUT of one or more look-up tables (LUTs), whether both a first register and a second register of the one or more registers are directly connected to a first LUT of the one or more LUTs, a combination thereof;
when the register is not directly connected to the LUT and a pass-through LUT can be directly connected to the register, generating, via the compiler, one or more pass-through LUTs that are directly connected to the register;
when both the first register and the second register are directly connected to the first LUT:
generating, via the compiler, a second LUT of the one or more LUTs;
disconnecting, via the compiler, the second register from the first LUT in response to generating the second LUT; and
directly connecting, via the compiler, the second register to the second LUT subsequent to disconnecting the second register from the first LUT;
receiving, at the compiler, a design to be implemented in a region of the IC;
providing, via the compiler, a first bitstream that configures the region of the IC, wherein the first bitstream comprises a modification of the design and a first LUT mask, such that the first bitstream supplies the initial condition value derived from the modification of the design to the one or more registers, by:
when the register is directly connected to the one or more pass-through LUTs, providing the initial condition value to the register via the one or more pass-through LUTs; and
when the first register and the second register are directly connected to the first LUT and the second LUT, respectively, providing a first initial condition of the initial condition value to the first register via the first LUT and a second initial condition value of the initial condition value to the second register via the second LUT; and
providing, via the compiler, a second bitstream that is representative of an unmodified version of the design and comprises a second LUT mask, wherein the second bitstream configures the region of the IC by using the second LUT mask to facilitate supplying values associated with a function of the design to the one or more registers subsequent to the configuration of the region of the IC by the first bitstream.

US Pat. No. 10,394,987

ADAPTIVE BUG-SEARCH DEPTH FOR SIMPLE AND DEEP COUNTEREXAMPLES

INTERNATIONAL BUSINESS MA...

1. A computer system comprising:a processor in communication with one or more types of memory, the processor configured to:
provide a netlist indicative of connectivity and functional states of components of an integrated circuit design;
iteratively search through the netlist at a selected depth to locate errors within the netlist by a plurality of trials, each of the plurality of trials having a plurality of iterations, wherein iteratively searching through the netlist at a selected depth to locate errors within the netlist comprises performing a simulation process and a symbolic analysis process;
adaptively adjust the selected depth depending on any errors within the netlist being located, the selected depth increasing over time from an initial value as between the plurality of iterations;
adaptively adjust an amount of coverage of the netlist depending on any errors within the netlist being located, the amount of coverage of the netlist decreasing over time from an initial amount as between the plurality of iterations; and
manufacture the integrated circuit design.

US Pat. No. 10,394,984

TOOL TO PROVIDE INTEGRATED CIRCUIT MASKS WITH ACCURATE DIMENSIONAL COMPENSATION OF PATTERNS

International Business Ma...

1. A tool configured to process input data, comprising:an input to receive input data representing integrated circuit shapes within separate mask regions of a semiconductor fabrication mask for use in optical lithography; and
an output to provide output data representing a mask in which dimensions of mask shapes are compensated on the basis of image content in the vicinity of each mask shape when the mask is projected during optical lithography;
the tool being configured to match a partially coherent lithographic image by superposing a sum of images from a set of coherent systems and a sum of images from a set of loxicoherent systems, where the loxicoherent systems include a compound system comprised of a paired coherent system and an incoherent system that act in sequence, with an output of the coherent system being input as a self-luminous quantity to the incoherent system of the pair, and with the output of the incoherent system being an output of the loxicoherent system.

US Pat. No. 10,394,980

METHOD FOR GENERATING A SIMULATION-MODEL

HEXAGON TECHNOLOGY CENTER...

1. A method for generating a simulation-model corresponding to an actual produced part, the method comprising:producing an actual produced part based on a target Computer Aided Design (CAD)-model;
providing a target simulation-model corresponding to the target Computer Aided Design (CAD)-model;
generating a numerical representation of the actual produced part based on a measurement of the actual produced part; and
generating an actual simulation-model by modifying the target simulation-model such that the shape of the target simulation-model adapts to the numerical representation of the actual produced part.

US Pat. No. 10,394,976

METHOD OF EXPLOITING HYDROCARBONS FROM A SEDIMENTARY BASIN COMPRISING CARBONATE ROCKS, BY MEANS OF STRATIGRAPHIC SIMULATION

IFP ENERGIES NOUVELLES, ...

1. A method for oil exploitation in a sedimentary basin including at least one layer of carbonate sediments using a stratigraphic simulator for reconstruction of sedimentary history of the basin from a geological time t to a current time by use of at least one rock sample from each layer and a representative volume element scale determined as a function of the at least one rock sample with steps being carried out for each layer comprising:A. determining from measurements carried on each rock sample parameters of a microstructural model representative of a diagenetic state of each layer at the current time with each sample parameter of the microstructural model being defined at the scale;
B. identifying from the measurements carried out on each rock sample at least one diagenetic state undergone by sediments of each layer from the geological time t to the current time and determining minimum and maximum variations of each parameter of the microstructural model for each diagenetic state;
C. determining at least one mechanical parameter of the sediments of each layer for each diagenetic state by using medium modelling and variations of each parameter of the microstructural model determined for each diagenetic state;
D. assessing the petroleum potential of the basin at least by use of the stratigraphic simulator, determining each mechanical parameter for each diagenetic state and selecting at least one zone of the basin with a highest petroleum potential; and
E. exploiting the basin in accordance with each selected zone.

US Pat. No. 10,394,975

DEVICE AND METHOD FOR CALCULATING STABILITY AND PREDICTING ERROR OF POWER SYSTEM NETWORK

Korea Electric Power Corp...

1. A device for determining stability of a power system network and predicting an error thereof, the device comprising a processor configured to:receive standard object information from a power system network;
determine connection state stability Sstate representing when a network connection state is stable on the basis of the standard object information, wherein the standard object information comprises at least one of:
a number of times to retry to connect to the network ConnRtryCnt until a state is changed from a temporary error state to a permanent error state;
a number of times to retry to connect to the network ConnFailRtryCnt in the permanent error state;
a number of times to reject trying to connect to the network ConnRej;
a list of alternative paths to a main path NetAltPth;
states of the alternative paths to the main path AltPthSt; or
an available valid path availablePath;
determine connection time stability Stime representing when a network connection time is stably maintained on the basis of the standard object information, wherein the standard object information comprises at least one of:
an average connection time ConnAvTmms; or
a current-connection-state maintenance time ConnCurTmms after connection to the network;
determine final network connection stability using the network connection state stability Sstate and the connection time stability Stime,
wherein the device further comprises:
an error prediction information display device connected to the processor and displaying error prediction information determined using the determined standard object information, to notify an operator with a current state of the network, and
wherein the error prediction information comprises at least one of:
the final network connection stability;
the connection state stability Sstate;
the connection time stability Stime; or
network path information and values of states of the network.

US Pat. No. 10,394,974

GEOMETRY BASED METHOD FOR SIMULATING FLUID FLOW THROUGH HETEROGENEOUS POROUS MEDIA

Arizona Board of Regents ...

1. A computer-implemented method comprising:receiving a digital file comprising geometric data defining a three-dimensional model of an object disposed in a fluid-flow path of an endovascular system;
defining geometric representations of a plurality of sample volumes of a portion of the fluid-flow path;
determining an orientation for the model relating to the sample volumes;
for each of the sample volumes within which a portion of the model is disposed:
calculating a first volume based, at least in part, on the volume of the sample volume;
calculating a second volume based at least partially on the volume of the portion of the model disposed in the sample volume;
calculating a porosity based at least partially on the first volume and the second volume; and
repeating the calculating the first volume, calculating the second volume, calculating a porosity for each of the sample volumes within which a portion of the model is disposed;
generating a porosity profile based on the calculated porosities of the sample volumes;
simulating a fluid-flow in a computational model of the fluid-flow path of the endovascular system containing the three-dimensional model of the object using the generated porosity profile;
evaluating the outcome of a procedure to implant the object in the endovascular system and evaluating the efficacy and geometry of the object for maintaining open vasculature, using the simulation results.

US Pat. No. 10,394,973

METHODS AND APPARATUS FOR USING ANALYTICAL/STATISTICAL MODELING FOR CONTINUED PROCESS VERIFICATION (CPV)

FISHER-ROSEMOUNT SYSTEMS,...

1. A method comprising:determining distribution characteristics for a plurality of process control parameters obtained from one or more field devices of a process control system, the process control parameters being based on a first set of historical batch datasets, respective ones of the historical batch datasets being measured while manufacturing corresponding ones of first batches at corresponding ones of first times;
generating a model batch based on the distribution characteristics of the plurality of process control parameters;
determining a quantity of simulated batch datasets to be included in a first set of simulated batch datasets, the first set of simulated batch datasets corresponding to a first set of simulated batches, the quantity being equal to a difference between a predetermined threshold number of total batch datasets and a total number of the historical batch datasets within the first set of historical batch datasets;
generating the first set of simulated batch datasets based on the quantity by, for each one of the simulated batches of the first set of simulated batches:
generating values for the plurality of process control parameters based on the model batch; and
determining a quality prediction based on the generated values;
generating a model based on the first set of simulated batch datasets and the first set of historical batch datasets; and
implementing the model via a server during a manufacture of a second batch at a second time subsequent to the first times to determine whether a fault has occurred in the process control system during the manufacture of the second batch, the implementing of the model to facilitate continued process verification and fault detection when the total number of the historical batch datasets within the first set of historical batch datasets is less than the predetermined threshold number of total batch datasets.

US Pat. No. 10,394,971

HYBRID SIMULATION OF A COMPUTING SOLUTION IN A CLOUD COMPUTING ENVIRONMENT WITH A SIMPLIFIED COMPUTING SOLUTION AND A SIMULATION MODEL

International Business Ma...

1. A computer-implemented method for simulation of a large scale computing solution to determine and test deployment of the large scale computing solution before full deployment, the method comprising:creating a computing solution for deployment on a physical system of computer resources with an initial state of a deployment configuration, where the computing solution is a special version of the large scale computing solution and has an element corresponding to each component of the large scale computing solution and each element includes at least one open virtualization format (OVF) file;
creating a simulation model corresponding to the computing solution wherein the simulation model includes a plurality of model elements, each of the plurality of model elements corresponding to one of each element of the computing solution that simulates a load on the system for the corresponding element;
running a simulation;
running a hybrid simulation by directly deploying both the computing solution and the simulation model together to the physical system of computer resources;
dynamically scaling up the computing solution with the simulation model by steps while running benchmark tests at each step, monitoring system performance of the physical system deploying the computing solution while running the benchmark tests and adjusting the deployment configuration; and
deploying the large scale computing solution with the adjusted deployment configuration determined by scaling up the simulation model.

US Pat. No. 10,394,968

COMPUTER AIDED DESIGN SYSTEM WITH IN-CONTEXT MODELING

Onshape Inc., Cambridge,...

1. A method for designing parts in context within CAD software, comprising:displaying a model within an assembly modeling environment of the CAD software;
selecting a part within the displayed model;
creating an assembly context, wherein the assembly context includes:
an assembly state reference to an assembly state at the time the assembly context was created; and
a master instance comprising an instance of the selected part;
creating an assembly version which records the displayed assembly state at the time of assembly version creation, and retaining an assembly version reference to the assembly version within the assembly context;
tracking the master instance within the assembly context, wherein the master instance is an instance of the selected part when the assembly context was created, and using the master instance for orientation of the assembly context;
switching to a part modeling environment for editing the selected part prior to recording any in-context references;
displaying, within the part modeling environment of the CAD software, the selected part of an assembly of the model, and further displaying the assembly state of the assembly context around the selected part wherein only the selected part is editable and the assembly state around the selected part is not editable;
selecting one or more geometric elements within the displayed assembly state for use in a reference for one or more features of the part;
recording, within the assembly context, the reference and a topology of the selected one or more geometric elements;
selecting between multiple assembly contexts to create references to geometric elements in different assembly states;
recording, within the assembly context, additional references and topologies of additional geometric elements as the additional geometric elements are selected and referenced by additional features;
exiting the part modeling environment and returning to the assembly modeling environment;
monitoring parts and sub-assemblies of the model for changes which require change to the assembly state of the assembly context, and upon requiring change displaying user interface controls to update references stored in the assembly context;
updating the assembly context by:
identifying a transform of geometry in an assembly coordinate system and a topology from a part environment using a parametric history based reference;
replacing the assembly state of the assembly context with a selected or current assembly state; and
copying the identified topology into the assembly context in place of prior topology; and
applying the recorded reference and additional references when solving the assembly to update the model.

US Pat. No. 10,394,966

SYSTEMS AND METHODS FOR MULTI-PROTOCOL, MULTI-FORMAT UNIVERSAL SEARCHING

Entefy Inc., Palo Alto, ...

1. A non-transitory computer readable medium storing computer readable instructions, which, upon execution by at least one or more processing units, cause the one or more processing units to:obtain a first plurality of data objects for a first user, wherein the first plurality of data objects comprises:
one or more data objects in each of a first plurality of formats; and
one or more data objects sent or received via each of a first plurality of protocols;
designate a first plurality of message objects, each message object corresponding to at least a portion of a data object from among the first plurality of data objects;
create one or more associations between one or more of the first plurality of message objects;
receive a query from the first user requesting at least one message object from the first plurality of message objects;
generate one or more index search terms based, at least in part, on the received query;
generate a set of one or more search results including one or more message objects from among the first plurality of message objects, in response to the generated one or more index search terms,
wherein the set of one or more search results set is based, at least in part, on one or more index parameters for one or more of the generated one or more index search terms, and
wherein at least one of the one or more index parameters is determined individually for the first user;
determine from a syntax of one or more communications of the first user that an expression has a meaning corresponding to a first index search term; and
create an index parameter based on the expression and assign it to each data object corresponding to the first index search term.

US Pat. No. 10,394,963

NATURAL LANGUAGE PROCESSOR FOR PROVIDING NATURAL LANGUAGE SIGNALS IN A NATURAL LANGUAGE OUTPUT

INTERNATIONAL BUSINESS MA...

1. A computer-implemented method of operating a speech synthesizer (SS) circuit configured to convert natural language inputs to natural language outputs and provide a natural language alert that communicates that the natural language outputs may contain error, the computer-implemented method comprising:converting, using a machine translation circuit of the SS circuit, a natural language input to natural language input data, wherein the natural language input comprises a human source language;
performing, using the machine translation circuit of the SS circuit, a translation operation on the natural language input data to translate the natural language input data to a natural language output that represents a target human language;
wherein the translation operation comprises performing a confidence level analysis on at least one portion of the translation operation to generate at least one confidence level signal that represents a confidence level that the natural language output that results from the translation operation contains error;
wherein the translation operation further comprises, based at least in part on the at least one confidence level that the natural language output contains an error, selecting a portion of a disfluency natural language data stored in a memory and embedding the selected portion of the disfluency natural language data into the natural language output;
wherein the selected portion of the disfluency natural language data is embedded into the natural language output in a location selected to communicate that a portion of the natural language output may contain an error; and
converting, using the SS circuit, the natural language output that has been embedded with the selected portion of the disfluency natural language data into speech or text comprising a natural language output having disfluency, wherein the natural language output is in the target human language and the disfluency is in the target human language.

US Pat. No. 10,394,948

METHOD AND SYSTEM FOR CUSTOMIZING A MOBILE APPLICATION USING A WEB-BASED INTERFACE

ProntoForms Inc., Ottawa...

1. A method of customizing a mobile-form application to manage the sharing of data between a plurality of mobile devices, the method comprising:selecting by a user, a mobile-form application template from a plurality of mobile-form application templates stored in a server;
customizing by the user one or more elements of said selected mobile-form application template to create a customized mobile-form application, wherein the step of customizing includes using wizards and a set of form controls that can be dragged and dropped or defined on a single or multiple form view;
distributing by the server said customized mobile-form application to a plurality of mobile devices via a gateway to collect and display a plurality of data; and
routing said data to the plurality of mobile devices based on one or more policies and user access permissions that determine in what sequence forms data is shared and updated based, in part, on network conditions;
wherein one of the set of form controls comprises a list of values, the list of values stored on the server, the gateway updating the list of values on the plurality of mobile devices opportunistically based on the available network bandwidth and the size of the list.

US Pat. No. 10,394,946

REFINING EXTRACTION RULES BASED ON SELECTED TEXT WITHIN EVENTS

SPLUNK INC., San Francis...

1. A computer-implemented method comprising:receiving data indicating selection of a first event from among a plurality of events, wherein each event includes a portion of raw data and is associated with a time stamp;
receiving data indicating a selection of one or more portions of text within the first event to be extracted as one or more fields;
automatically determining at least one field extraction rule that extracts one or more values for the one or more fields from the text within the plurality of events when the extraction rule is applied to the plurality of events;
causing display of an annotated version of the plurality of events, wherein the annotated version indicates the portions of the text within the plurality of events extracted by the field extraction rule, the annotated version of the plurality of events including a second event to be used to refine field extraction; and
based on a selection of at least one portion of text within the second event to be extracted, updating the field extraction rule.

US Pat. No. 10,394,944

SYSTEM AND METHOD OF ANNOTATING UTTERANCES BASED ON TAGS ASSIGNED BY UNMANAGED CROWDS

VoiceBox Technologies Cor...

14. A system of tagging utterances with Named Entity Recognition (“NER”) labels using unmanaged crowds, the system comprising:a computer system having one or more physical processors programmed with computer program instructions that, when executed by the one or more physical processors, cause the computer system to:
obtain a plurality of utterances relating to a domain, the domain being associated with a plurality of entities, each entity relating to a category of information in the domain;
generate a first annotation job configured to request that at least a first portion of an utterance be associated with one of a first set of entities, from among the plurality of entities;
generate a second annotation job configured to request that at least a second portion of the utterance be associated with one of a second set of entities, from among the plurality of entities;
cause the first annotation job and the second annotation job to be deployed to the unmanaged crowd of users; and
receive a plurality of annotations provided by the unmanaged crowd, the plurality of annotations comprising a first annotation relating to the first annotation job and a second annotation relating to the second annotation job.

US Pat. No. 10,394,942

METHOD AND SYSTEM FOR CONTEXTUALLY PLACED CHAT-LIKE ANNOTATIONS

Google LLC, Mountain Vie...

1. A computer-implemented method for annotating an electronic record based on input by a plurality of users, comprising:receiving, from a user of the plurality of users, a user selection of a portion of the electronic record, wherein the electronic record is a collaborative electronic record hosted by a sever, wherein content of the electronic record other than annotations is editable by the plurality of users via a network;
in response to receiving the user selection of the portion of the electronic record, providing, by a processor, a discussion window for presentation, to each of the plurality of users, in an expanded form at a location in a margin with respect to the electronic record;
receiving, by the processor, annotation input entered in the discussion window by each of the plurality of users;
updating, by the processor, the discussion window to present the annotation input of the plurality of users as a plurality of successive annotations, wherein the discussion window in the expanded form is scrollable to present the plurality of successive annotations; and
in response to a user selection of the discussion window to request the presentation of the discussion window to be collapsed, providing the discussion window for presentation in a collapsed form at the location in the margin with respect to the electronic record, wherein the discussion window in the collapsed form presents information related to the plurality of successive annotations without presenting the plurality of successive annotations and irrespective of a position of a cursor with respect to the electronic record or the discussion window in the collapsed form, wherein the information related to the plurality of successive annotations comprises an identifier of the user, a number of the plurality of successive annotations, and a date associated with the plurality of successive annotations.

US Pat. No. 10,394,941

COLLABORATIVE AUTHORING

Microsoft Technology Lice...

1. A method for collaborative authoring of a document by a first user at a first computing device, the method comprising:receiving an update from a second computing device at the first computing device indicating that a second user is editing the document at a location within text of the document;
automatically applying the update to the text of the document viewable at the first computing device; and
automatically providing, at the first computing device, an annotation identifying a name of the second user displayed within the text of the document at the location of the update, wherein the annotation indicates that the document is being edited by the second user at the location within the text.

US Pat. No. 10,394,939

RESOLVING OUTDATED ITEMS WITHIN CURATED CONTENT

FUJITSU LIMITED, Kawasak...

1. A method of resolving outdated items within curated content, the method comprising:determining whether an electronic source link of a curated item that is included in the curated content is broken;
in response to the electronic source link not being broken:
determining whether linked content at the electronic source link is consistent with a version of a document originally accessed on which the curated item is based (item document), and
in response to the linked content not being consistent with the item document:
locating an alternative source for an inconsistent source link by:
combining content from two or more curated items of the curated content;
identifying a common context of the combined content, the common context being indicative of a topic of the curated content; and
executing a search on an external search engine using the common context to obtain two or more external alternatives to the curated item;
computing vector distances between each of the two or more external alternatives and the combined content;
obtaining an update time of each of the two or more external alternatives; and
ranking the two or more external alternatives based on the computed vector distances and the update times;
based on the ranking, selecting one of the two or more external alternatives to replace the curated item in the curated content; and
replacing the electronic source link with an alternative electronic link of the selected external alternative;
in response to the electronic source link being broken, locating an alternative item by:
assigning an element weight to elements of the item document, the element weight being based on a function of the element in the item document, and
comparing the item document and one or more cached documents in a search index (stored documents) based on a context similarity between elements of the item document and corresponding elements of the stored documents factoring in the element weights assigned to the compared elements; and
following an expiration date of the curated item, locating updated content that is relevant to the curated item.

US Pat. No. 10,394,938

VISUAL SEARCHING AND NAVIGATION

MBTE Holdings Sweden AB, ...

1. A method for interacting with a digital model of an item to access technical data associated with the item, the method comprising the steps of:causing display, by one or more processors of a user computing entity, of the digital model of the item via a user interface executing on the user computing entity, wherein (a) the digital model comprises one or more components of the item, and (b) the one or more components are selectable via the user interface;
receiving, by the one or more processors, first input via the user interface selecting a first component of the one or more components of the digital model;
responsive to receiving the first input selecting the first component of the one or more components, generating a topics window comprising a listing of a plurality of topics associated with the first component of the one or more components, wherein each of the plurality of topics is selectable via the user interface;
causing display, by the one or more processors, of the topics window via the user interface, wherein the topics window is superimposed on at least a portion of the digital model;
receiving, by the one or more processors, second input via the user interface selecting a first topic of the plurality of topics from the topics window;
responsive to having a smart preview configuration setting and receiving the second input selecting the first topic of the plurality of topics:
(a) generating, by the one or more processors, a smart preview window, wherein (i) generating the smart preview window comprises identifying preface data and the technical data associated with the first topic and suppressing the preface data from the smart preview window, and (ii) the smart preview window does not comprise the preface data for the first topic and comprises at least a portion of the technical data for the first topic, and
(b) causing display, by the one or more processors, of the smart preview window via the user interface, wherein the smart preview window is superimposed on at least a portion of the digital model and on at least a portion of the topics window; or
responsive to having a link preview configuration setting and receiving the second input selecting the first topic of the plurality of topics:
(a) generating, by the one or more processors, a link preview window, wherein the link preview window comprises at least a portion of preface data for the first topic and at least a portion of the technical data for the first topic, and
(b) causing display, by the one or more processors, of the link preview window via the user interface, wherein the link preview window is superimposed on at least a portion of the digital model and on at least a portion of the topics window.

US Pat. No. 10,394,936

VIEWING HIERARCHICAL DOCUMENT SUMMARIES USING TAG CLOUDS

International Business Ma...

1. A computer program product comprising a non-transitory computer readable storage medium having computer readable program code embodied therewith for navigating a hierarchically structured document using iconic representations thereof displayed in a graphical user interface, said computer readable program code comprising:computer readable program code configured to obtain access to a hierarchically structured document having a plurality of hierarchical levels;
computer readable program code configured to, for each of said hierarchical levels, obtain a word list with a word count for each word included therein;
computer readable program code configured to, for each of said hierarchical levels, create a tag cloud based on said words in a respective one of said hierarchical levels and said word counts thereof;
computer readable program code configured to display, in said graphical user interface, a table of contents including a plurality of labels associated with respective ones of said hierarchical levels;
computer readable program code configured to facilitate display of a first tag cloud of said tag clouds in association with a first hierarchical level upon detecting a selection of a corresponding one of said plurality of labels associated with said first hierarchical level, wherein said display said first tag cloud includes a nested icon representing a second tag cloud of said tag clouds corresponding to a second hierarchical level at a different hierarchical level of said hierarchically structured document than said first hierarchical level,
wherein said table of contents and said tag clouds are associated to display in-context visualization of information about select levels of said hierarchical structure document;
computer readable program code configured to obtain a selection of a given one of said words in said first tag cloud;
computer readable program code configured to highlight, in response to said selection of said given one of said words, all entries in said table of contents for said hierarchically structured document containing at least one instance of said given one of said words;
computer readable program code configured to receive a selection of said nested icon displayed in said first tag cloud; and
computer readable program code configured to display said second tag cloud corresponding to said second hierarchical level of said hierarchically structured document upon detecting said selection of said nested icon, wherein said second tag cloud is displayed simultaneously with said first tag cloud.

US Pat. No. 10,394,935

DYNAMICALLY DISPLAYING ONLINE DOCUMENTS BASED ON DOCUMENT OBJECT ATTRIBUTES

International Business Ma...

1. A computer-implemented method comprising:extracting, by one or more processors, a plurality of data objects from a document, wherein a data object among the plurality of data objects is uniquely identified based on, at least in part, text content and style associated with the data object, wherein a final style associated with the data object is calculated through at least one of style hierarchical relationship and priority arrangement;
obtaining, by the one or more processors, sizes of corresponding data objects among the plurality of data objects by constructing a document object model associated with the plurality of data objects, wherein obtaining sizes of corresponding data objects includes determining whether the style associated with the corresponding data object is at least one of relevant and irrelevant to the sizes of the corresponding data objects, wherein if the style associated with the corresponding data object is determined to be irrelevant, then the irrelevant style is excluded from consideration when obtaining the sizes of the corresponding data objects, wherein the irrelevant style is the style that does not affect the size of the data object, including one or more of underlining, strikethrough, font color, and background color, and wherein the relevant style is the style that does affect the size of the data object, including one or more of font, font size, bold, italics, superscript, subscript, heading, and text;
generating, by the one or more processors, a layout repository based on, at least in part, the sizes, the text content, and the style associated with the plurality of data objects; and
rendering, by the one or more processors, the plurality of data objects based on, at least in part, the layout repository, so as to online display the document.

US Pat. No. 10,394,931

BALANCING PROVENANCE AND ACCURACY TRADEOFFS IN DATA MODELING

International Business Ma...

1. A computer implemented method for generating an analytics model, the method comprising:receiving a data set having a defined first set of features;
defining a second set of features based on an application of a set of domain knowledge data to the first set of features;
generating a features hierarchy based on relationships between features of the first and second sets of features; and
generating an analytics model based on a selection of features from the features hierarchy, wherein the analytics model includes features from the first and second sets of features while maintaining a defined accuracy value.

US Pat. No. 10,394,930

BINARY VECTOR FACTORIZATION

Intel Corporation, Santa...

1. A processor, having:decode circuitry to decode instructions from an instruction stream;
a data cache unit including circuitry to cache data for the processor; and
a compute unit having an approximate matrix multiplication (AMM) circuit comprising:
a data receptor to receive a weight vector w and an input vector x, both of size N, and a compression regulating parameter n;
a factorizor circuit to factorize w into w?B·s, by computing a binary factorized matrix B of size N×n, and a dictionary vectors of size n, wherein the factorizor circuit is to search in an ordered vector for a best matching binary combination that solves for a corresponding element in w that scales with a base 2 logarithm of N; and
a binary multiplier circuit to compute sT (BTx) to approximate wTx.

US Pat. No. 10,394,929

ADAPTIVE EXECUTION ENGINE FOR CONVOLUTION COMPUTING SYSTEMS

MediaTek, Inc., Hsinchu ...

1. A system for performing convolution computing, comprising:an analysis module to generate a mode select signal to select one of a matrix mode and a filter mode based on results of analyzing convolution characteristics, wherein the results include at least a comparison of resource utilization between the matrix mode and the filter mode; and
a convolution module coupled to the analysis module, the convolution module including a plurality of processing elements, each of which includes arithmetic computing circuitry, wherein the convolution module is configured according to the matrix mode for performing matrix multiplications converted from convolution computations, and is configured according to the filter mode for performing the convolution computations.

US Pat. No. 10,394,928

CORNEAL DYNAMIC MODEL ALGORITHM AND SYSTEM USING THE SAME

NATIONAL TAIWAN UNIVERSIT...

1. A corneal examination method, comprising:(S1) reading an actual corneal deformation of a corneal of a tester from an ophthalmotonometer, wherein the ophthalmotonometer snaps corneal sectional images while blowing air onto the corneal, and generates the actual deformation according to the corneal sectional images;
(S2) substituting a Young's modulus initial value and a damping coefficient initial value into a mathematical equation, wherein a calculated corneal deformation is obtained from a mathematical equation with the Young's modulus initial value and the damping coefficient initial value, and the mathematical equation is:
in which the term wl0 is the measured displacement on corneal surfacewhere Ml is modal massmodal frequency is ?Dl=?l?1??l2, Pl(cos ?) is the Legendre polynomials, g(?) is the air pressure distribution on corneal surface, ?l is modal damping ratio, s(t) is the air puff time history, R is the corneal radius, h is the thickness of the diaphragm, ? is the cornea density, ?+ and ?? are densities inside and outside the cornea, l is the modal order,E is the Young's modulus, T is the tension on the diaphragm, and v is the Poisson's ratio, and images recorded from tonometer could provide the s(t), R, and h, and the densities, ?, ?+ and ?? are given from normal values, ?l is given 3˜5%, T is obtained from the intraocular pressure, v is assumed 0.4˜0.49;(S3) determining whether error amount between the calculated deformation and the actual deformation is a minimum or not; and
(S4) determining the Young's modulus initial value and the damping coefficient initial value as a Young's modulus and a damping coefficient of the corneal, and judging whether the tester's corneal have disease, wherein the disease includes induced flaucoma, retinal lesion.

US Pat. No. 10,394,927

ELECTRONIC APPARATUS, ELECTRONIC APPARATUS SYSTEM, GRAPHING METHOD, AND NON-TRANSITORY COMPUTER-READABLE RECORDING MEDIUM

CASIO COMPUTER CO., LTD.,...

1. An electronic apparatus, comprising:at least one processor; and
at least one memory storing instructions, wherein
the instructions are executed by the at least one processor to perform:
identifying at least one scientific theoretical formula relating to one or more scientific characteristics of which data is measured,
setting a coordinate system that includes a coordinate axis to which at least a part of the identified at least one scientific theoretical formula is assigned, and
plotting the measured data of the one or more scientific characteristics on the set coordinate system to display a first graph on a display.

US Pat. No. 10,394,925

AUTOMATING WEB TASKS BASED ON WEB BROWSING HISTORIES AND USER ACTIONS

International Business Ma...

1. A system comprising:a processor operatively coupled to a memory;
a message communications channel operatively coupled to the processor to receive a task in a textual format;
a synthesizer operatively coupled to the message communication channel to extract command information from the task, the extracted information including task parameters converted into a command, the command selected from the group consisting of: syntax and unstructured text in a core-command, wherein the core command identifies the task to be performed;
the synthesizer to identify at least two prior scripts related to the command and rank a relevance of the scripts relative to the task;
the synthesizer to generate a sequence of actions from the ranked scripts into a combined script; and
execution of the synthesized sequence of actions associated with the combined script to return information relevant to the task.

US Pat. No. 10,394,923

PLATFORM APPARATUS FOR ACTIVELY DISTRIBUTED QUANTITATIVE COLLECTIVE KNOWLEDGE

1. One or more servers hosting a web site, the web site comprising:a platform device capable of forming a network with a plurality of ID-detectable users or participants for gathering and processing, by the users or participants, of items of information stored in storage spaces in a memory which are in each case code-identifiable and assigned to a plurality of different topics, wherein the platform device comprises:
the storage spaces each being formed by a dual unit (DuU), each said dual unit (DuU) comprising:
a first storage space assigned to a predefined topic and provided with initial information formulated by an initial participant but not editable by any other individual user or participant;
a second storage space assigned to the first storage space, which is editable by any one individual user or participant and is construed for the importation, by the plurality of users or participants, of supplementary information concerning the initial information stored in the first storage space;
an identifying device for identifying all users or participants that contribute supplementary information to a prescribed storage space, with respect to the identifier thereof, and for storing the same in a user-participant register, such that, when an importation of a new item of supplementary information to the second storage space is carried out by any one of the users or participants thus identified by means of an activation unit, an automated transmission unit (DuU-feed) containing the new item of supplementary information transmits at least part of the associated dual unit to at least some of the other registered users or participants registered in the user-participant register,wherein:in the editable second storage space supplementary information is imported by the users or participants in the form of individual evaluations of the items of information stored in the first space, at least one adding device being provided for the purpose of counting the individual evaluations imported, together with a memory provided in the second storage space for the purpose of saving the number of counted individual evaluations, wherein an individual evaluation on the part of the users or participants is carried out by effecting a predefined importation, a swarm value being defined as the number of predefined importations introduced by the users or participants into the second storage space;
a first adding device is provided for the purpose of counting the imported individual positive evaluations, together with a memory for the purpose of saving this number to the second storage space, and a second adding device is provided for the purpose of counting the individually imported negative evaluations, together with a memory for the purpose of saving this number to the second storage space, it being possible for an individual evaluation to be made by the users or participants by means of a predefined importation, while a positive swarm value is defined as the number of predefined importations to the second storage space that correspond to a positive evaluation, a negative swarm value being defined as the number of predefined importations to the second storage space that correspond to a negative evaluation; and
the first adding device adds the positive evaluations stored in the second space to a first number and a second adding device adds the negative evaluations stored in the second space to a second number, while a first dividing device is provided for the purpose of stating the ratio of the first and second numbers in the form of a percentage value.

US Pat. No. 10,394,922

USER INDEX WITH NICKNAMES

Facebook, Inc., Menlo Pa...

1. A method comprising:by a computing device, receiving data that includes at least one event indicating an association between a nickname and a primary name;
by the computing device, determining whether the at least one association between the nickname and the primary name meets a nickname association threshold, wherein the association meets the nickname association threshold when at least a threshold number of events associating the nickname with the primary name are identified in the data,
wherein determining whether the at least one association meets a nickname association threshold comprises accessing a counter value associated with a combination of the nickname and the primary name, wherein the at least one association meets the nickname association threshold when the counter value is greater than the nickname association threshold; and
by the computing device, generating at least one expanded index entry that associates the nickname with the primary name when the at least one association meets the nickname association threshold.

US Pat. No. 10,394,921

CAREER PATH NAVIGATION

Microsoft Technology Lice...

1. A method comprising:incorporating a set of instructions for implementing a career navigation system into one or more memories of a social network system, the set of instructions configuring one or more computer processors of the social network system to perform operations for implementing a user interface that includes a user navigable career path for presentation on a client device, the operations comprising:
receiving an indication of a first origin position in the user-navigable career path via the user interface presented on the client device;
in response to the indication, depicting in the user interface a first level of succedent likely-transition positions relative to the first origin position and a first level of precedent likely-transition positions relative to the first origin position;
calculating position metrics for the first level of succedent likely-transition positions and the first level of precedent likely-transition positions, the position metrics indicating likelihoods of transitions from the first level of precedent likely-transition positions to the first origin position and from the first origin position to the first level of succedent likely-transition positions;
ordering the first level of succedent likely-transition positions and the first level of precedent likely-transition positions in the user interface according to the position metrics;
receiving a user selection of one of the first level of succedent likely-transition positions from the user interface; and
in response to the receiving of the user selection, causing the user navigable career path to be updated on the client device, the updating including depicting a new origin position, a new first level of succedent likely-transition positions, and a new first level of precedent likely-transition positions, the new first level of succedent likely-transition positions being a subset of a second level of succedent likely-transition positions, the subset of the second level of succedent likely-transition positions corresponding to the new origin position.

US Pat. No. 10,394,920

DATA VERIFICATION DEVICE

FUJITSU LIMITED, Kawasak...

1. A data verification device comprising:a memory; and
a processor coupled to the memory, the processor executing a process including:
acquiring information as specific information from a plurality of sites that are registered as acquisition sources of the specific information;
specifying reliability of a site among the plurality of sites from which the information is acquired as the specific information based on storage content of a storage that stores therein reliability in association with each of the sites, wherein reliability of a site is calculated as a total of scores that each indicate reliability of information that is included in the site and acquired as the specific information and other specific information, the reliability of information being calculated as a total of a score based on an organization that manages the site, a score based on the last update date of the information, and a score indicating an amount of information in an HTML document corresponding to the site; and
outputting the information acquired as the specific information together with the specified reliability of the site from which the information is acquired.

US Pat. No. 10,394,916

PERSONALIZED SEARCH ENVIRONMENT

Microsoft Technology Lice...

1. A method executed on a computing device to provide a personalized search environment to users through their personal accounts, the method comprising:receiving a request to perform a search for a user based on the user's credentials of a personal account of a cloud-based service to which the user subscribes, the user having a tenant identifier corresponding to the cloud-based service, wherein the tenant identifier is assigned to the user and other users subscribing to the same cloud-based service by treating the user and the other users as members of an enterprise in order to receive complement search results from an enterprise environment associated with the enterprise;
authenticating the user through the cloud-based service based on the credentials of the personal account;
upon authentication the user through the cloud-based service based on the credentials of the personal account,
forwarding the search request to a personalized search application using the tenant identifier assigned to the user and the other users of the cloud-based service all with a corresponding personal account with the cloud-based service;
enabling performance of the search through an aggregation service associated with the cloud-based service, wherein the aggregation service maintains relevancy information aggregated from a plurality of resources associated with the user and with the other users of the same cloud-based service based on the assigned tenant identifier; and
providing search results of performance of the search to the user.

US Pat. No. 10,394,914

VISUALIZING QUERY RESULTS TO IMPROVE QUALITY OF SUBSEQUENT SEARCHES

International Business Ma...

1. A computer program product for improving the quality of subsequent searches, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:receiving a first request to perform a first search using one or more provided terms;
performing said first search using said one or more provided terms;
determining whether a previous search has been performed;
depicting a first representation of a first search result of said first search as a first area in response to said previous search not having been performed with a first set of terms of interest of said first search result displayed outside said first area, wherein said first set of terms of interest comprises one or more of the following: correlated terms in connection with said first search result, high frequency terms in connection with said first search result, synonyms of said one or more provided terms and facet values, wherein said first set of terms of interest is different from said one or more provided terms, wherein said first area represents a first set of documents that were found in said first search result using said one or more provided terms, wherein said first set of documents is accessible by a user selecting said first area, and
wherein said first area comprises a bubble or a circle.

US Pat. No. 10,394,913

DISTRIBUTED GROUPING OF LARGE-SCALE DATA SETS

Amazon Technologies, Inc....

1. A system comprising:a first computing device, wherein the first computing device comprises a processor programmed by executable instructions to at least:
determine a first cosine distance between a first data vector, represented by a first temporary probabilistic data structure, and a center of a first cluster of data vectors;
determine a second cosine distance between the first data vector, represented by the first temporary probabilistic data structure, and a center of a second cluster of data vectors;
determine that the first cosine distance is smaller than the second cosine distance;
modify a first probabilistic data structure using the first data vector, wherein the first probabilistic data structure comprises data, regarding the first cluster of data vectors, from which the center of the first cluster of data vectors is determined; and
transmit the first probabilistic data structure to a second computing device; and
the second computing device, wherein the second computing device comprises a processor programmed by executable instructions to at least:
determine a third cosine distance between a second data vector, represented by a second temporary probabilistic data structure, and the center of the first cluster of data vectors;
determine a fourth cosine distance between the second data vector, represented by the second temporary probabilistic data structure, and the center of the second cluster of data vectors;
determine that the third cosine distance is smaller than the fourth cosine distance;
modify a second probabilistic data structure using the second data vector, wherein the second probabilistic data structure comprises data, regarding the first cluster of data vectors, from which the center of the first cluster of data vectors is determined;
receive the first probabilistic data structure from the first computing device; and
generate a third probabilistic data structure using the first probabilistic data structure and the second probabilistic data structure, wherein the third probabilistic data structure comprises data, regarding the first cluster of data vectors, from which an updated center of the first cluster of data vectors is determined.

US Pat. No. 10,394,912

SYSTEM, METHOD, AND RECORDING MEDIUM FOR DATA MINING BETWEEN PRIVATE AND PUBLIC DOMAINS

INTERNATIONAL BUSINESS MA...

1. A data mining method, comprising:defining a set of filter constraints as a filter function for clustering users' private records of data of a private domain;
obtaining a set of data from a public domain by applying the filter function to users' public records of data of the public domain;
selecting a subset of the users' public records of data from the filtered set of data from the public domain that is common with the users' private records of data;
performing data mining on the selected subset of the users' public records of data in combination with the users' private records of data to match a user of the private domain to public records of the user of the private domain; and
creating a data file including the matched user of the private domain to the public records of the user of the private domain,
wherein the filter function clusters the users' private records into groups that allow a private domain owner to receive attributes and relationships of all elements in the public data set that are common with the private data set without revealing an individual identity of the user, and
wherein the set of the filter constraints comprises a function that captures the subset of the users' public records of data who are of interest to the private domain, and only performs the data mining with that set of information from the public domain.

US Pat. No. 10,394,911

SELECTING CONTENT FOR DEVICES SPECIFIC TO A PARTICULAR USER

Google LLC, Mountain Vie...

1. A computer-implemented method performed in a data processing apparatus, comprising:determining, for a particular user identifier, an origin time specifying a time of occurrence of a request, by a user corresponding to the user identifier, for content in a particular interest category;
receiving, at a particular time after the origin time, a request to serve content to the user corresponding to the user identifier with media related to a different interest category;
upon receiving, at the particular time, the request to serve content to the user corresponding to the user identifier with the media relate d to the different interest category, calculating a time period that has elapsed between the particular time and the origin time of the particular interest category;
generating a relevance score for a given portion of content in the particular interest category based, in part, on the calculated time period that has elapsed between the particular time and the origin time of the particular interest category, wherein the relevance score for the content in the particular interest category decreases as the calculated time period that has elapsed between the particular time and the origin time increases;
selecting the given portion of content in the particular interest category rather than content in the different interest category based on the relevance score for the given portion of content in the particular interest category being higher than a different relevance score for content in the different interest category;
determining that the given portion of content is to be presented by a given user device from among a plurality of user devices that are active for the user based on a device prioritization scheme; and
transmitting, to the given user device, data that presents the selected given portion of content.

US Pat. No. 10,394,910

PERSONAL CONTENT ITEM SEARCHING SYSTEM AND METHOD

Dropbox, Inc., San Franc...

1. A user computer for searching user's content items hosted by an online content management service, the user computer comprising at least one processor configured to:obtain a search query;
use the search query to identify in a local index at the user computer a set of one or more of the user's hosted content items that satisfy the search query;
wherein a version of a content item in the set of one or more content items that satisfy the search query is stored at the user computer at a time the search query is obtained;
wherein the local index contains version information for the content item, the version information indicating that the version of the content item stored at the user computer is different than another version of the content item hosted by the online content management service, the other version of the content item stored at one or more servers operated by the online content management service;
generate, based on the version information for the content item in the local index, a search answer summary to indicate that the version of the content item stored at the user computer is different than the other version of the content item hosted by the online content management service; and
display, in a graphical user interface at the user computer, the search answer summary for the content item.

US Pat. No. 10,394,909

REDUCING REDIRECTS

Google LLC, Mountain Vie...

1. A computer-implemented method comprising:transmitting, from a user device, a search query to a search system;
receiving, at the user device and from the search system, a search results page in response to the search query, wherein the search results page includes search results generated for resources that are determined to be responsive to the search query, wherein:
a first search result in the received search results page is a modified search result that includes:
(i) a title and a snippet of text extracted from a first resource that is identified by a search result in response to the search query and that is located at a first uniform resource locator, wherein the first uniform resource locator specifies a first location at which the first resource is stored, and the first resource is a resource that that includes instructions that causes a user device to redirect to a second resource stored at a second location specified by a second uniform resource locator; and
(ii) a modified link that is the second uniform resource locator that specifies the second location at which the second resource is stored, wherein the modified link is a replacement of the first uniform resource locator with the second uniform resource locator, the second location being different from the first location:
wherein:
the second resource is a resource that is different from the first resource; and
a first request for the first resource by the user device causes the user device to process the instructions in the first resource to redirect to the second resource by issuing a second request for the second resource; and
the first search result does not include the first uniform resource locator;
in response to user selection of the title or the snippet of text extracted from the first resource and that is included in the first search result, processing the modified link that is the second uniform resource locator to initiate a request, by the user device, for the second resource using the second uniform resource locator; and
receiving, by the user device and in response to the user selection of the title or the snippet of text extracted from the first resource and that is included in the first search result, the second resource.

US Pat. No. 10,394,908

SYSTEMS AND METHODS FOR MODIFYING SEARCH RESULTS BASED ON A USER'S HISTORY

GOOGLE LLC, Mountain Vie...

1. A computer-implemented method comprising:at a server system having one or more processors and memory:
receiving a submitted first search query from a search requester;
identifying search results from a document repository, wherein the identified search results are responsive to the received first search query;
enhancing the search results from the document repository by identifying a history event from a user activity repository, the identified history event being different from the identified search results and specifying an activity that was previously performed by the search requester and being relevant to the submitted first search query; and
returning both the identified search results from the document repository and the identified history event from the user activity repository for simultaneous presentation to the search requester.

US Pat. No. 10,394,906

PHYSICAL LOCATION HISTORY WITH DIGITAL MEMBER ENTRIES OR LOCATION HISTORY ENTRIES

1. A system for creating and/or using physical location histories, comprising:a processing system connected to a telecommunications network;
an application that configures a handheld mobile communication device of each individual member of a member network to, upon instances of (i) a physical encounter between the individual member of the member network and a second individual member of the member network and upon instances of (ii) a physical encounter between the individual member and a stationary vendor member of a plurality of stationary vendor members of the member network at a physical premises of the stationary vendor member, transmit to the processing system, automatically, upon the physical encounter being recognized by short range communication, at least one of a visual image, an audiovisual file, an audio file and a text file, thereby generating a location history entry in an account of the individual member and of any second individual member participating in the physical encounter, the location history entry including (i) the at least one of a visual image, an audiovisual file, an audio file and a text file, (ii) a time and date of the physical encounter, (iii) a location of the second individual member or stationary vendor member and (iv) an identity of the individual member and of either the second individual member or the stationary vendor member,
wherein a location of the individual member and the second individual member is determined by a positioning system, wherein the processing system is remote from the devices;
the application configured to maintain a physical encounter history viewable on the handheld mobile communication device and searchable from the handheld mobile communication device (i) by the identity of the stationary vendor member or individual member or second individual member, (ii) by a geographic location of the physical encounter and (iii) by time or date of the physical encounter,
the processing system including a database of physical encounter histories of members of the member network whose accounts received the location history entry that was generated during the physical encounters,
wherein the individual member's account with the member network allows the physical encounter history to be accumulated through transmission of location history entries from multiple handheld mobile communication devices of the individual member over time,
the application downloadable onto a particular handheld mobile communication device from the processing system by using the account such that the system authorizes the particular handheld mobile communication device to transmit at least the location history entries of the physical encounters to the database,
the location history entries containing information about physical encounters between individual members and second individual members and information about physical encounters between individual members and stationary vendor members,
wherein the location history of a particular individual member includes at least one visual timeline of physical encounters of the particular individual member.

US Pat. No. 10,394,905

METHOD AND APPARATUS FOR A DIGITAL LEG HISTORY

1. A method of combining enhanced computerized searching for a target business with use of humans as physical encounter links, comprising:maintaining a processing system connected to a telecommunications network;
providing an application that allows a handheld mobile communication device of each individual member of a member network, the device in communication with a—positioning system, upon a physical encounter between the individual member and a stationary vendor member of a plurality of stationary vendor members of the member network at a physical premises of the stationary vendor member, to transmit key data of the stationary vendor member and of the individual member to the processing system automatically as a result of the physical encounter, a location of each individual member's device determined by the positioning system, the key data being a URL or an identifier associated with the URL;
maintaining, using the processing system, a database of physical location histories of members of the member network whose key data was transmitted to the processing system during the physical encounters,
determining, by the processing system, a physical location relationship recorded in the database between a searching person who is a member of the member network, a reference individual member of the member network and a first stationary vendor member of the plurality of stationary vendor members, upon the searching person making a search query on a search engine having access to the processing system; and
responding to the search query by generating a computerized search result that increases a ranking of the first stationary vendor member based on the physical location relationship wherein the relationship is as follows:
(a) the reference individual member's physical location history includes key data of the first stationary vendor member; and (b) the searching person's physical location history and the reference individual member's physical location history each include key data of a second stationary vendor member of the plurality of stationary vendor members,
wherein the searching person's physical location relationship to the first stationary vendor member is such that the searching person has a physical location relationship with the second stationary vendor member who has a physical location relationship with the reference individual member who has a physical location relationship with the first stationary vendor member.

US Pat. No. 10,394,904

PHYSICAL LOCATION HISTORY WITH ADVERTISING

1. A computer-implemented method of targeting individuals for advertising using digital physical encounter histories, comprising:maintaining a processing system that is connected to a telecommunications network and configured to provide an account to an individual member who has a URL and is mobile and to a stationary vendor member that has a URL;
providing an application that configures a handheld mobile communication device of each individual member of a member network, the device in communication with a positioning system, to, upon instances of a physical encounter between a pair of URL-possessing elements of a physical web, the pair including the individual member and the stationary vendor member, at a physical premises of the stationary vendor member, the physical premises containing a transmitting device, transmit the URL of the stationary vendor member and the URL of the individual member, to the processing system automatically as a result of a short range communication from the transmitting device to the handheld mobile communication device or from the handheld mobile communication device to the transmitting device confirming the physical encounter, a location of the individual member at the physical premises determined by the positioning system, the URL of the individual member associated with the individual member before the physical encounter between the individual member and the stationary vendor member;
the application maintaining a viewable physical encounter history on the handheld mobile communication device that includes URLs from multiple stationary vendor members and is searchable from the handheld mobile communication device, the viewable physical encounter history being chronological in at least one mode;
maintaining, using the processing system, a database of physical encounter histories of members of the member network whose URL was transmitted to the processing system during the physical encounters, the individual member's account having data transfer privileges that allow the individual member's physical encounter history to be accumulated from multiple handheld mobile communication devices of the individual member over time; and
serving, by the processing system, advertisements of particular stationary vendor members to the physical encounter histories recorded on handheld mobile communication devices of the individual members such that a particular individual member who clicks on a particular advertisement appearing on the particular individual member's physical encounter history is taken to the web site associated with the URL of the particular stationary vendor member, a content of the particular advertisement determined by a profile of URLs recorded in the physical encounter history of the particular individual member.

US Pat. No. 10,394,903

HIGHLY SCALABLE APPLICATION SERVICES

SAP SE, Walldorf (DE)

1. A method comprising: initiating, in a distributed computing environment having a plurality of nodes, execution of a plurality of application services corresponding to a plurality of user sessions; executing all functional units of each application service as part of a node of the distributed computing environment in a separate service environment and without remote calls to other services; executing each user session in a separate and distinct node of the distributed computing environment; and dynamically composing, by a special node forming part of the plurality of nodes, additional nodes to execute user sessions according to functional needs of a corresponding application and to workload, the composing comprising controlling consumption of resources by a node; wherein the distributed computing environment comprises: an in-memory database platform; a duster computing framework; and an in-memory query engine providing: selective access to the in-memory database platform and the duster computing framework; shared application services that are reusable across different application services; application specific services that are not reusable across different application services; and wherein the respective service environments provide access to service configurations for at least a portion of the services and provide direct access to interfaces of other services for inter-service interaction without a proxy.

US Pat. No. 10,394,901

METHOD AND SYSTEM FOR RESOLVING SEARCH QUERY AMBIGUITY IN A PRODUCT SEARCH ENGINE

WALMART APOLLO, LLC, Ben...

1. A computer implemented method comprising:a server obtaining a candidate pair from a query log, the candidate pair comprising a unigram and a bigram, the unigram being a single word of a first query in the query log, the bigram being two adjacent words of a second query in the query log, and the unigram being the two adjacent words of the bigram combined into a single word;
the server receiving first customer interaction data for a first customer interaction with first search results corresponding to the unigram from the query log, wherein the first customer interaction data comprises:
views, by a first customer, of products associated with the first search results; or
purchases, by the first customer, of products associated with the first search results;
the server receiving second customer interaction data fora second customer interaction with second search results corresponding to the bigram from the query log, wherein the second customer interaction data comprises:
views, by a second customer, of products associated with the second search results; or
purchases, by the second customer, of products associated with the second search results;
the server comparing the first customer interaction data corresponding to the unigram with the second customer interaction data corresponding to the bigram to:
determine if the candidate pair includes a dominant form for customer engagement based on either (1) the first customer interaction data corresponding to the unigram showing better customer interaction than the second customer interaction data corresponding to the bigram, or (2) the second customer interaction data corresponding to the bigram showing better customer interaction than the first customer interaction data corresponding to the unigram;
determine if the candidate pair includes equivalent forms for the customer engagement based on the first customer interaction data corresponding to the unigram showing equivalent customer interaction to the second customer interaction data corresponding to the bigram; and
determine if the candidate pair includes an un-comparable pair for the customer engagement based on the first customer interaction data corresponding to the unigram being related to a first product category and the second customer interaction data corresponding to the bigram being related to a second product category different from the first product category;
the server creating a rule regarding a treatment of the unigram or the bigram in analyzing future queries, the rule being one of a dominant form rule based at least in part on the candidate pair including the dominant form for the customer engagement, an equivalent form rule based at least in part on the candidate pair including the equivalent forms for the customer engagement, or an un-comparable form rule based at least in part on the candidate pair including the un-comparable pair for the customer engagement;
the server receiving a query;
the server analyzing the query according to the rule to identify query results; and
the server presenting the query results.

US Pat. No. 10,394,899

DOCUMENT TRACKING IN HETEROGENEOUS APPLICATION ENVIRONMENTS

International Business Ma...

1. A method of naming documents according to a document naming convention (DNC), comprising:allocating, from time to time, in memory of a computer by a document naming convention (DNC) server, a pool of document unification identifiers (DUIDs) for use in naming documents by a plurality of document processing applications (DPAs) coupled to the DNC server;
receiving a document name request from a document name generator (DNG) requesting a document name on behalf of one of the DPAs;
responsive to receiving the document name request, acquiring an available DUID from the pool;
providing the acquired DUID to the requesting DNG for use in naming a document, the DNG generating a name for the document and returning the generated name to the one of the DPAs, the one of the DPAs naming the document using the generated name; and
modifying the DUID pool to indicate the acquired DUID as being unavailable.

US Pat. No. 10,394,898

METHODS AND SYSTEMS FOR ANALYZING DISCRETE-VALUED DATASETS

The MathWorks, Inc., Nat...

1. A system for determining the structure of an electronic dataset, the system comprising:one or more processors configured to perform the steps of:
receiving a matrix with a first dimension corresponding to items, a second dimension corresponding to features, and discrete-valued elements indicating a presence, absence, or frequency of the features in the items;
generating an engineered features set and a weights set for the matrix, the engineered features set and the weights set corresponding to latent structures in the matrix, generating the engineered features set and the weights set comprising:
generating a first engineered feature and a first weights vector corresponding to a first latent structure in the matrix, generating the first engineered feature and the first weights vector comprising:
updating the first engineered feature of the engineered features set using the matrix and the first weights vector of the weights set, and
updating the first weights vector of the weights set using a mutual information of the matrix and the first engineered feature; and
generating a second engineered feature and a second weights vector corresponding to a second latent structure using a subset of the matrix associated with the first latent structure, generating the second engineered feature and the second weights vector comprising:
determining the subset of the matrix using at least one of the first engineered feature and the first weights vector;
updating the second engineered feature of the engineered features set using the subset and the second weights vector of the weights set; and
updating the second weights vector of the weights set using a mutual information of the subset and the second engineered feature;
receiving a request indicating at least one of the engineered features set;
identifying items based on the matrix and the indicated at least one of the engineered features set; and
providing a response based on the identified items.

US Pat. No. 10,394,897

VISUALIZATION OF SERIAL PROCESSES

International Business Ma...

1. A method comprising:constructing, by one or more computer processors, a process model of a serial hauling process based, at least in part, on an underlying statistical model, the process model representing each of one or more instances of the serial hauling process as a series of interconnected nodes, wherein:
the serial hauling process includes one or more events that are performed in order to represent a sequence of load-hauling stages at a mining site, each instance of the serial hauling process representing a respective truck operating at the mining site;
each node is associated with a respective event of the one or more events, a time at which the associated event occurred in a respective instance of the serial hauling process, and the truck represented by the respective instance of the serial hauling process, each event representing at least one of the truck at an end of a respective prior stage in the sequence of load-hauling stages and the truck at a beginning of a respective next stage in the sequence of load-hauling stages;
connectors link nodes together to form the series of interconnected nodes, the connectors representing respective stages of the one or more instances of the serial hauling process, and each connector representing the truck performing a stage of the respective instance of the serial hauling process represented by the linked nodes; and
each load-hauling stage of the one or more instances of the serial hauling process corresponding to a respective stage type, each stage type representing activity occurring between a respective pair of sequential events of the one or more events of the serial hauling process;
scoring, by one or more computer processors, each load-hauling stage of the one or more instances of the serial hauling process, each load-hauling stage receiving a score based, at least in part, on the process model and a respective stage duration;
categorizing, by one or more computer processors, each load-hauling stage of the one or more instances of the serial hauling process into a respective category of a plurality of categories for the respective stage type based, at least in part, on the process model and the respective score, wherein (i) the plurality of categories are differentiated by one or more thresholds that represent respective score values, (ii) each category represents a range of score values, and (iii) one or more of the plurality of categories are associated with outlier stages within each stage type;
receiving, by one or more computer processors, data that describes the serial hauling process, wherein the data that describes the serial process associates the one or more instances of the serial hauling process with a first type of factor represented by a first set of characteristics at the mining site and a second type of factor represented by a second set of characteristics at the mining site;
presenting on a computer display, by one or more computer processors, a plurality of cycle-time visualizations of the process model such that (i) each cycle-time visualization presents a respective instance of the serial hauling process as a curve representing each respective node and each respective connector of the respective instance of the serial hauling process to describe the respective truck at each event and at each stage of the sequence of load-hauling stages at the mining site, (ii) each cycle-time visualization visually associates the stages of the respective instance of the serial hauling process with respective categories such that the plurality of cycle-time visualizations provides a comparison of the one or more instances of the serial hauling process that identifies one or more outlier load-hauling stages within the one or more instances of the serial hauling process; and
responsive to identifying, within the presented plurality of cycle-time visualizations, a cross-process indicating a breakdown of a working rhythm of a plurality of trucks performing the sequence of load-hauling stages at the mining site, stratifying on the computer display, by one or more computer processors, the plurality of cycle-time visualizations of the one or more instances of the serial hauling process based, at least in part, on the first type of factor at the mining site and the second type of factor at the mining site to identify a root cause for the breakdown of the working rhythm based on at least one of the first type of factor and the second type of factor, the plurality of cycle-time visualizations stratified such that the plurality of cycle-time visualizations are visually grouped based on shared associations with characteristics in the first set of characteristics and shared associations with characteristics in the second set of characteristics, wherein each cycle-time visualization is respectively associated with one characteristic in the first set of characteristics and one characteristic in the second set of characteristics.

US Pat. No. 10,394,896

IDENTIFYING RELATIONSHIPS OF INTEREST OF ENTITIES

International Business Ma...

1. A computer-implemented method for identifying relationships of interest of entities in a data modeling environment, wherein the data modeling environment represents objects as entities with links representing relationships between the entities, comprising:receiving a query, the query comprising two or more entities and one or more links with at least one of the entities or links designated as an output item, wherein the output item determines an item type that will be returned by a response to the query;
analyzing, by a processor, the query to identify each dumbbell in the query, wherein a dumbbell is a link with a first entity at a first end of the link and a second entity at a second end of the link;
examining, by the processor, each identified dumbbell to determine if the dumbbell includes the output item;
discarding a first identified dumbbell not including the output item in response to the first identified dumbbell not including the output item;
keeping a second identified dumbbell including the output item and discarding property values of items of the second identified dumbbell in response to the second identified dumbbell including the output item; and
adding the second identified dumbbell to a catalogue of relationships including a link type and entity types of the dumbbell in response to the second identified dumbbell including the output item and in response to the catalogue of relationships not already listing a stored dumbbell having the link type and entity types, wherein the catalogue of relationships comprises a data structure storing relationships.

US Pat. No. 10,394,895

IDENTIFYING RELATIONSHIPS OF INTEREST OF ENTITIES

International Business Ma...

1. A computer program product for identifying relationships of interest of entities in a data modeling environment, wherein the data modeling environment represents objects as entities with links representing relationships between the entities, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:receiving a query, the query comprising two or more entities and one or more links with at least one of the entities or links designated as an output item, wherein the output item determines an item type that will be returned by a response to the query;
analyzing, by a processor, the query to identify each dumbbell in the query, wherein a dumbbell is a link with a first entity at a first end of the link and a second entity at a second end of the link;
examining each identified dumbbell to determine if the dumbbell includes the output item;
discarding a first identified dumbbell not including the output item in response to the first identified dumbbell not including the output item;
keeping a second identified dumbbell including the output item and discarding property values of items of the second identified dumbbell in response to the second identified dumbbell including the output item; and
adding the second identified dumbbell to a catalogue of relationships including a link type and entity types of the dumbbell in response to the second identified dumbbell including the output item and in response to the catalogue of relationships not already listing a stored dumbbell having the link type and entity types, wherein the catalogue of relationships comprises a data structure storing relationships.

US Pat. No. 10,394,893

SOCIAL WHERE NEXT SUGGESTION

GOOGLE LLC, Mountain Vie...

1. A computer-implemented method to provide destination recommendations to social groups, comprising:receiving, by one or more computing devices, a group recommendation request from a first remote computing device associated with a requesting user, the group recommendation request comprising a current location of the requesting user and a request for a next destination based in part on the current location of the requesting user;
identifying, by the one or more computing devices, a social group, the social group identified based on one or more location signals received from one or more remote computing devices indicating that the remote computing devices are within a defined proximity threshold of the current location of the requesting user and that the two or more location signals were generated within a defined time threshold of the group recommendation request, the social group further identified based on identification of common social connection information;
generating, by the one or more computing devices, a group recommendation list for the social group, the group recommendation list comprising a list of suggested destinations for the group based at least in part on personal preference profiles of each member of the social group; and
displaying, by the one or more computing devices, the group recommendation on the first remote computing device.

US Pat. No. 10,394,892

DYNAMIC CONTENT DELIVERY SEARCH SYSTEM

EBAY INC., San Jose, CA ...

1. A method comprising:receiving, in a search bar, a first keyword of a search string;
in response to the receiving of the first keyword in the search bar, performing, using a hardware processor, a search for a first set of results matching the first keyword, the first set of results cached in memory;
in response to determining the first set of results, accessing images that correspond to the first set of results from a database;
causing presentation of the images that correspond to the first set of results;
upon performing the search for the first set of results, receiving, in the search bar, a second keyword of the search string;
in response to the receiving of the second keyword, using the second keyword by the hardware processor to refine the first set of results, the refining comprising removing results from the first set of matching results cached in memory that fail to match the second keyword to generate a second set of matching results, the second set of matching results being cached in memory, wherein the receiving of the first keyword, the receiving of the second keyword, the performing the search, and the refining of the first set of matching results occur without user selection of an enter key;
in response to the refining, updating the images being presented by presenting images that correspond to the second set of matching results; and
in response to completion of entry of the search string in the search bar, causing presentation of search results that are cached in memory, the search results being a last set of results determined based on a last keyword of the search string.

US Pat. No. 10,394,891

DISTRIBUTED GRAPH DATABASES THAT FACILITATE STREAMING DATA INSERTION AND QUERIES BY EFFICIENT THROUGHPUT EDGE ADDITION

International Business Ma...

1. A computer-implemented method for efficient throughput edge addition, comprising:determining, by a device operatively coupled to a processor, vertex placement, based on a hash or an arbitrary placement function;
placing, by the device, outgoing edge requests into appropriate queues of a firehose; and
placing, by the device, incoming edge requests into appropriate queues of the firehose, wherein for each queue, in parallel, the device:
sends requests to add vertices for all sources in an outgoing edges set, and all targets in an incoming edges set, and wait for vertex ids of all added vertices and MAXEID from each machine, respectively.

US Pat. No. 10,394,889

APPARATUS AND METHOD FOR SUPPLYING PATH PROTECTED SEARCH RESULTS FROM A SEMI-STRUCTURED DOCUMENT DATABASE

MarkLogic Corporation, S...

1. An apparatus, comprising:a processor; and
a memory connected to the processor, the memory storing instructions executed by the processor to:
traverse paths of a document with semi-structured data,
for each path that is unprotected add a term at a terminating node of an unprotected path to an index as a query term and for each path that is protected combine the term at a terminating node of a protected path with a permission to form a combined query term that is added to the index;
wherein the memory stores the index and a semi-structured document database including a collection of documents having semi-structured data; and
wherein the memory stores a query processor with instructions executed by the processor to form from a received query an expanded query including a received search term and a permission associated with a user submitting the received query, the query processor comparing the expanded query to combined query terms in the index to block document access when the user does not have protected path permission and returning query results when the expanded query matches a combined query term in the index.

US Pat. No. 10,394,887

AUDIO AND/OR VIDEO SCENE DETECTION AND RETRIEVAL

Mercury Kingdom Assets Li...

1. A system, comprising:a data store storing a searchable index of video segments, each video segment associated with a quote by which the video segment is indexed, and one or more of the video segments being created via a method including steps of:
receiving, from a user, a query including the quote from a video source,
identifying the video source associated with the quote,
determining a location of the quote within the video source based on a video source quote index database, and
forming the one or more video segments, the one or more video segments including at least a portion of the video source that includes the quote.

US Pat. No. 10,394,886

ELECTRONIC DEVICE, COMPUTER-IMPLEMENTED METHOD AND COMPUTER PROGRAM

SONY CORPORATION, Tokyo ...

1. An electronic device, comprising:circuitry configured to
perform speech recognition on an audio signal emitted from a content source, the content source outputting the audio signal concurrent with a displayed image on a first display, the content source including the first display and the content source being external to the electronic device;
linguistically analyze an output of the speech recognition for named-entities;
perform an Internet or database search for named-entities, that are recognized in the linguistic analysis of the output, to obtain query results; and
display, on a second display of the electronic device, an output interface displaying information relating to the query results on a timeline, the timeline including a line which includes, for a plurality of search results, the information related to the query results including a time, an image, and a textual description associated with the image, the image and the textual description being graphically linked to a corresponding portion of the line, the timeline displaying the query results in a chronological order.

US Pat. No. 10,394,885

METHODS, SYSTEMS AND COMPUTER PROGRAM PRODUCTS FOR GENERATING PERSONALIZED FINANCIAL PODCASTS

INTUIT INC., Mountain Vi...

1. A computing system, comprising:a user data module comprising computer executable instructions stored in a memory of a computer and executable by a processor of the computer and being configured to acquire user data associated with a user from an account that the user has with a computerized financial management system and analyze the user data acquired from the account to identify a keyword associated with a financial topic of interest to the user automatically without user intervention;
a keyword analyzer in communication with the user data module and comprising computer executable instructions executable by the processor and being configured to receive the keyword identified by the user data module and calculate a weight of the keyword automatically without user intervention, calculating the weight of the keyword comprising:
examining allocation of at least one resource of the user;
making a determination of at least one of a proportion of the allocation dedicated to a use associated with the keyword, a recent allocation dedicated to the use, and a category of the use, and
assigning the weight corresponding to the determination, wherein the weight is indicative of the user's level of interest and a relevance in the financial topic associated with the keyword;
a content analyzer in communication with the keyword analyzer and comprising computer executable instructions executable by the processor and being configured to receive the keyword and the weight from the keyword analyzer and identify financial media content based on the keyword and the weight automatically without user intervention, the financial media content comprising a plurality of sentences, identifying the financial media content comprising:
receiving a plurality of financial media content items;
assigning a weight to each of the financial media content items using a word cloud algorithm, wherein the word cloud algorithm uses anonymized profile and keyword data of other users with similar profiles to the user to determine a correlation between the other users and the user;
de-duplicating the weighted financial media content items; and
filtering, sorting, and prioritizing the de-duplicated weighted financial media content items based on the keywords and their associated weights and selecting at least one of the weighted financial media content items based on the weight of the selected at least one item and the weight of the keyword;
a summarizer in communication with the content analyzer and comprising computer executable instructions executable by the processor and being configured to receive the financial media content, identify a relevant sentence of the plurality of sentences in the financial media content automatically without user intervention, and repeat the identifying for a pre-determined number of items until a pre-determined podcast length elapses;
a speech processor in communication with the summarizer and comprising computer executable instructions executable by the processor and being configured to receive the relevant sentence and synthesize speech based on the relevant sentence automatically without user intervention;
the summarizer being further configured to generate a digital audio file as a personalized podcast including the synthesized speech summarizing financial media content of interest to the user; and
the computer being configured to assemble and distribute the digital audio file through a network to a computing device of the user.

US Pat. No. 10,394,883

CLASSIFICATION TECHNIQUE FOR MULTI-BAND RASTER DATA FOR SORTING AND PROCESSING OF COLORIZED DATA FOR DISPLAY

AGRIAN, INC., Clovis, CA...

1. A method of classifying multi-band raster data for a display of colorized data, comprising:summarizing a multi-band raster dataset, by
collecting a plurality of numerical elements corresponding to each band in the multi-band raster dataset to generate a set of observations,
modifying numerical values in the set of observations by applying feature scaling to normalize the set of observations by calculating a mean and standard deviation of numerical values in each band, and
converting the observations into a set of clusters representing an approximate distribution of normalized observations relative to each other by applying a Gaussian mixture model representing a composite distribution of the observations in the multi-band raster dataset, wherein data points representing the observations for the composite distribution are drawn from one of k Gaussian sub-distributions, each observation having its own probability;
retrieving and preparing summarized multi-band rasters for display, by de-normalizing the numerical values to synthesize the set of clusters, and generating a random set of independent, identically distributed vectors to calculate a Cholesky decomposition of the set of clusters to produce a m×m matrix that quantifies a relation between each band in the multi-hand raster dataset, and multiplying each of the independent, identically distributed vectors by the m×m matrix to generate an approximate range of values representing each synthesized observation;
projecting each synthesized observation in the set of clusters by applying a projection function to convert values corresponding to pixels in each synthesized observation into single numbers, to form a sequence of single numbers representing the multi-band raster dataset;
partitioning the sequence of single numbers representing the multi-band raster dataset into intermediate quantiles of equally-sized groups of the single numbers; and
combining intermediate quantiles to form a final set of quantiles having a plurality of quantile breaks derived by representing each group by its highest and lowest values to identify values for colorization in the multi-band raster dataset.

US Pat. No. 10,394,882

MULTI-IMAGE INPUT AND SEQUENCED OUTPUT BASED IMAGE SEARCH

International Business Ma...

1. A method comprising:receiving, by an image search engine, a document-identifying data set that identifies a document;
determining, by the image search engine, a search result rule based on content of the document;
receiving, the image search engine, a search query including a subject-matter-describing data set, a first boundary-condition-describing data set and a second boundary-condition-describing data set, wherein the first-boundary-condition-describing data set and the second boundary-condition-describing data set define, in part, a pathway of physical progression that links a first boundary condition to a second boundary condition, wherein the pathway of physical progression defines a physical transformation of a physical object from a first form into a second form, and wherein the image search engine includes an image analytics software;
determining, by the image search engine, the first boundary condition based on the first boundary-condition-describing data set;
determining, by the image search engine, the second boundary condition based on the second boundary-condition-describing data set;
finding, by the image search engine, a set of search results that meet the following criteria: (i) apparently relate to a subject matter of the subject-matter-describing data set, and (ii) are apparently included in the pathway of physical progression, wherein (a) each search result in the set of search results is an image, and (b) a first search result in the set of search results apparently falls between the first boundary condition and the second boundary condition based, at least in part, on a content of the first search result and a physical characteristic of the first search result;
determining, by the image search engine, a context for the first search result based on the physical characteristic of the first search result in relation to the pathway of physical progression;
generating, by the image search engine, an ordered set of images that includes the first search result, wherein a location of the first image in the set of ordered images is based on the context of the first search result and the pathway of physical progression; and
returning, by the image search engine, the set of search results in human readable form based, at least in part, on the search result rule, wherein the search result rule relates to at least one of the following: (i) a manner in which the set of search results are organized, or (ii) the scope of the set of search results returned.

US Pat. No. 10,394,880

SYSTEM, METHODS, AND PROGRAM PRODUCT TO TRACE CONTENT GENEALOGY

IMAGINE COMMUNICATIONS CO...

1. A non-transitory computer-readable medium that is readable by a computer managing content and distribution of media, the computer readable medium comprising a set of instructions that, when executed by the computer, cause the computer to perform the following operations:receiving a metadata record for a media file responsive to a user input to thereby associate metadata to the media file;
receiving a request from a user to modify the metadata record for the media file;
determining an identity of the user to thereby determine if the user has pre-established permissions to modify the metadata record;
modifying the metadata record for the media file responsive to user input and responsive to determining the user has the pre-established permissions;
providing current auditing of changes to the metadata;
receiving a request to access a copy function;
providing a copy form including an input field for entering a number of copies, an input field for entering a numbering scheme, and an input field for entering media attribute data;
displaying a selection of metadata value categories to copy; and
displaying copy values from the copy form selected by the user for review or modification by the user.

US Pat. No. 10,394,877

METHOD AND SYSTEM FOR STORYTELLING ON A COMPUTING DEVICE VIA SOCIAL MEDIA

OATH INC., New York, NY ...

1. A method comprising:analyzing, by a processor of a computing device, a first set of media items associated with a user, each media item having associated metadata;
identifying, by the processor, based on analysis of the associated metadata in the first set, one or more related characteristics among the media items in the first set, said characteristics corresponding to a time period and a type of content depicted within the media items;
forming, by the processor, a cluster of media items associated with an event based on the identified one or more related characteristics, each media item in said cluster comprising said type of content associated with said time period;
repeating, by the processor, the analyzing step and the identifying step for a second set of media items, each media item in the second set having associated metadata, each media item in said second set being identified based on a social connection of the user in a social media site;
adding, by the processor, one or more media items from the second set to the cluster of media items, said added media items comprising said one or more related characteristics that formed the basis for said formation of the cluster;
analyzing, by the processor, a plurality of templates within a template database based on criteria defined by the one or more characteristics, and based on said analysis, identifying a set of templates that have characteristics matching the one or more characteristics, said template characteristics further comprising information indicating time criteria for identifying a time within content of a media item associated with said event;
selecting, by the processor, said set of templates;
editing, by the processor, each media item in said cluster based on said selected templates, said editing comprising organizing said media items in said cluster according to said time of said event based on a time period indicated by of each media item's characteristics; and
creating, by the processor, a mixed-media module comprising said edited media item cluster.

US Pat. No. 10,394,876

FUZZY TERM PARTITION IDENTIFICATION

International Business Ma...

1. A method for building and applying fuzzy term partitions, the method comprising:building a fuzzy category taxonomy;
building a fuzzy term extractor based on the built fuzzy category taxonomy;
extracting a fuzzy term based on the built fuzzy term extractor;
associating the extracted fuzzy term with a plurality of context data;
producing a context data partition for the extracted fuzzy term based on the associated plurality of context data; and
applying a weight to the extracted fuzzy term.

US Pat. No. 10,394,875

DOCUMENT RELATIONSHIP ANALYSIS SYSTEM

VortexT Analytics, Inc., ...

7. A method of analyzing relationships between documents, the method comprising the acts of:extracting text from source documents received from an external document source;
storing the extracted text;
creating an index of the extracted text;
computing a document vector for each source document using the extracted text automatically when the extracted text is stored;
storing the document vectors for each source document;
receiving a selection of a plurality of source documents as a target dataset and parameters of a query via a user interface;
generating a result dataset containing documents of interest from the target dataset based on the query; and
automatically selecting a visualization model for clustering the documents of interest based the number of documents of interest in the result dataset and rendering the result set using selected visualization model in a user interface,
wherein the act of extracting text from source documents received from an external document source further comprises the act of automatically routing each source document to a text extraction component selected from a plurality of text extraction components based on an evaluation of features of the source document against at least one scheduling parameter, and
wherein the act of act of automatically routing each source document to a text extraction component further comprises the acts of:
routing source documents having a file size less than a first size threshold to a small text file extraction component configured for extracting text from files with file sizes less than the first size threshold;
routing source documents having a file size greater than a second size threshold to a large text file extraction component configured for extracting text from files with file sizes greater than the second size threshold; and
routing source documents having a file size between the first size threshold and the second size threshold to either the small text file extraction component or the large text file extraction component based a weighted average of sizes of source documents having a file size between the first size threshold and the second size threshold.

US Pat. No. 10,394,874

SYNTACTIC PROFILING OF ALPHANUMERIC STRINGS

MICROSOFT TECHNOLOGY LICE...

1. A computing device, comprising:a logic machine; and
a storage machine holding instructions executable by the logic machine to:
generate a plurality of multi-string clusters, each of which contains a plurality of alphanumeric strings of a computer-maintained dataset; and
generate further multi-string clusters via iteratively performing a combination operation in which a hierarchically-superior multi-string cluster is generated from a set of multi-string clusters, the combination operation including:
for each of a plurality of candidate pairs of multi-string clusters from the set of multi-string clusters, generating a plurality of syntactic profiles, where each syntactic profile describes an alphanumeric string from one multi-string cluster of the candidate pair and an alphanumeric string from the other multi-string cluster of the candidate pair;
for each of the plurality of candidate pairs of multi-string clusters, determining, for at least one of its syntactic profiles, a cost factor;
based on the cost factors determined for the syntactic profiles of the candidate pairs, selecting one of the candidate pairs; and
combining the multi-string clusters from the selected candidate pair to generate the hierarchically-superior multi-string cluster including all of the alphanumeric strings from the selected candidate pair of multi-string clusters.

US Pat. No. 10,394,873

METHOD AND SYSTEM FOR GENERATING PHONETICALLY SIMILAR MASKED DATA

Tata Consultancy Services...

1. A method for generating a group of phonetically similar masked data, the method comprising processor implemented steps of:preprocessing, by using a standard metaphone generator module, input dataset values, wherein the input dataset values comprising a dataset list of fictitious data values to be used as masked data;
determining, by using the standard metaphone generator module, a plurality of groups of phonetically similar data values present in the dataset list;
deriving, by using the standard metaphone generator module, metaphone value for each input dataset value of the input dataset values to be masked;
generating, by using a first numeric code generation module, a first numeric code from the derived metaphone value of the input dataset value to be masked;
selecting, by using a phonetically similar data values group selection module, one group of the phonetically similar data values out of the plurality of groups of the phonetically similar data values based on the generated first numeric code;
generating, by using a second numeric code generation module, a second numeric code from the input dataset value for selecting a masked value from a plurality of fictitious data groups; and
determining, by the processor, a group of masked output values from the plurality of fictitious data groups by mapping one or more input data groups to one of the plurality of fictitious data groups, wherein the group of masked output values are utilized to fetch a consistent masked value for said each input dataset value, and wherein for a particular group of the groups, the group of masked output values is consistent irrespective of occurrences of one or more input data groups.

US Pat. No. 10,394,872

LEARNING TOPICS BY SIMULATION OF A STOCHASTIC CELLULAR AUTOMATON

Oracle International Corp...

1. A method for identifying sets of correlated words comprising:receiving information for a set of documents;
wherein the set of documents comprises a plurality of words;
wherein a particular document of the set of documents comprises a particular word of the plurality of words;
running an inference algorithm over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
retrieving a first counter value from a first data structure,
based, at least in part, on the first counter value, assigning a particular topic, of a plurality of topics, to the particular word in the particular document to produce a topic assignment for the particular word,
after assigning the particular topic to the particular word, updating a second counter value in a second data structure to produce an updated second counter value,
wherein the updated second counter value reflects the topic assignment, and
wherein the first data structure is stored and accessed independently from the second data structure; and
determining, from the sampler result data, one or more sets of correlated words;
wherein the method is performed by one or more computing devices.

US Pat. No. 10,394,870

SEARCH METHOD

Hitachi, Ltd., Tokyo (JP...

1. A method for searching one or more documents with a computer for a specified string, the method comprising:a first step of dividing the specified string into a plurality of strings including a first string, as a first search key, and a second string, as a second search key;
a second step of grouping the one or more documents into a plurality of blocks which are each units of data that can each be read in by the computer by one read operation;
a third step of judging whether or not the first string appears in each of the plurality of blocks and including a first piece of appearance information indicating appearance of the first string with respect to each respective block in which the appearance occurs;
a fourth step of judging whether or not the second string appears in each of the plurality of blocks and including a second piece of appearance information indicating appearance of the second string with respect to each respective block in which the appearance occurs; and
a sixth step of, when the first piece of appearance information and the second piece of appearance information are included with respect to a first block in the plurality of blocks, reading in the first block and judging an existence of said specified string by comparing the document included in said first block with said specified string.

US Pat. No. 10,394,869

DYNAMICALLY LINKING INFORMATION IN A NETWORK

International Business Ma...

1. A method for dynamically linking information in a network using natural language processing on a computer system, the information contained in a message of a user in the network, wherein a user interface is provided for receiving and playing natural language input, the message being defined as a data structure comprising at least the information as well as a set of topics, defined by keywords extracted from the information, wherein a user profile of the user is defined as a data structure comprising at least a set of weighted topics defined by keywords as well as a system of rules used for extracting topics from information, the method comprising:recording information from a first user in the network in natural language;
translating the recorded information in natural language to text information;
identifying topics in the text information based on topics stored in a predefined database;
combining the identified topics in the message with the set of weighted topics in the user profile of the first user;
updating a weight of each of the identified topics in the user profile of the first user;
publishing the text information on the computer system; and
identifying a set of at least one second user in the network by matching topics of a user profile of the at least one second user with the identified topics of the text information, wherein the at least one second user is notified of the message only if
where t is a timestamp of the published information, s is a timestamp of a last notification of the at least one second user, t?s is calculated in seconds, w is a highest weight in the user profile for a set of weighted topics defined by the message, v is a sum of all weights of the user profile, f is a frequency of notifications of the at least one second user, and p is a predefined parameter.

US Pat. No. 10,394,868

GENERATING IMPORTANT VALUES FROM A VARIETY OF SERVER LOG FILES

International Business Ma...

1. A method, in a data processing system comprising a process and a memory coupled to the processor, for identifying suggestions as to which log files associated with data in a data warehouse to search for particular data, the method comprising:utilizing an identified data structure of a plurality of log files from a set of log files, selecting, by feature selection logic specifically configured by a log file evaluation mechanism within the data processing system, features from the contents of the log file;
grouping, by the feature selection logic, log files in the set of log files together based on the selected features;
from structured data of the grouped log files, extracting, by extraction logic specifically configured by the log file evaluation mechanism within the data processing system, log event sequences;
calculating, by correlation logic specifically configured by the log file evaluation mechanism within the data processing system, a correlation between the log event sequences and a plurality of data transaction tables from a set of data transaction tables in the data warehouse;
utilizing a highest valued correlate log sequence for the plurality of data transaction tables, determining, by the correlation logic, a business relevance value between the plurality of log files and a business analysis objective, wherein determining the business relevance value between each log file in the set of log files and the business analysis objective utilizes the following business relevance function:
where tr is the table relevance score, i is an integer value, and C is an indicator function and is determined using the following:where r is the relevance score, i is an integer value, and the threshold is a predetermined system design requirement;determining, by evaluation logic specifically configured by the log file evaluation mechanism within the data processing system, a utilized data ratio that indicates a proportion of the data in the data warehouse that has been interacted with as per the associated log file; and
identifying, by the evaluation logic, suggestions as to which log files in the set of log files should be searched for particular data based on the business relevance value and the utilized data ratio.

US Pat. No. 10,394,867

FUNCTIONAL SUMMARIZATION OF NON-TEXTUAL CONTENT BASED ON A META-ALGORITHMIC PATTERN

Hewlett-Packard Developme...

1. A system comprising:a processor; and
a non-transitory computer readable medium storing instructions that are executed by the processor to:
convert non-textual content into binary data and tokenize the binary data associated with the non-textual content into a plurality of tokens;
receive, via each summarization engine of a plurality of summarization engines, the plurality of tokens to provide a summary of the non-textual content, wherein the summary of the non-textual content comprises a binary substring;
apply each meta algorithmic pattern of at least one meta algorithmic pattern to at least two summaries to provide a meta-summary of the non-textual content using the at least two summaries;
identify at least one class term for each given class of a plurality of classes of non-textual content, the at least one class term extracted from non-textual content in the given class, wherein the at least one class term comprises the binary substring having a normalized ratio higher than a threshold;
extract at least one summarization term from the meta-summary;
determine similarity values of the non-textual content over each given class of the plurality of classes of non-textual content, each similarity value indicative of a similarity between the at least one summarization term and the at least one class term for each given class; and
select a class of the plurality of classes for the non-textual content based on the similarity values that are determined.

US Pat. No. 10,394,866

SYSTEM AND METHOD FOR ASYNCHRONOUS CLIENT SERVER SESSION COMMUNICATION

MasterObjects, Inc., (NL...

1. A method, comprising:automatically detecting; on a client computer, modification by a user of a search query for content from one or more remote content sources in an entry field;
sending a request message containing a string representing an incomplete version of the search query over a network to a server system comprising one or more computers serving a plurality of client computers,
receiving, by the server system, the string;
matching, by the server system, the string to entries in a cache of queries and search results previously retrieved from one or more content sources;
retrieving, by the server system, data indicative of the search results matching the incomplete version of the search query;
asynchronously sending, by the server system to the client computer a message containing at least a portion of the data indicative of the search results;
receiving, on the client computer, the message; and
displaying at least a portion of the data indicative of the search results on the client computer.

US Pat. No. 10,394,865

TEXT-BASED CONTENT MANAGEMENT METHOD AND APPARATUS OF ELECTRONIC DEVICE

Samsung Electronics Co., ...

1. An electronic device, comprising:a memory configured to store application data of applications of the electronic device;
a communicator;
a display; and
at least one processor configured to:
display, via the display, a text input window while executing an application regarding a message service,
receive, at the electronic device, at least one text input on the text input window,
detect, prior to a sending of a message, at least one entity text among the at least one text input on the text input window, the detected at least one entity text distinguished from among the at least one text input,
receive a first selection input for selecting an entity text among the at least one entity text,
search, based on the first selection input, the application data stored in the memory,
display results of the search, the results comprising a list of relevant information corresponding to the selected entity text corresponding to the first selection input, the selected at least one entity text being a search keyword for generating the list of the relevant information,
generate, in response to a receiving of a second selection input for selecting a relevant information from the list of the relevant information, a text-based content message including normal text content and metadata, each text input provided within the text input window being configured as normal text and the selected relevant information corresponding to the second selection input is configured as metadata linked to the normal text associated with the selected entity text,
send, via the communicator, the text-based content message to an external device, and
display, on the display, the text-based content message in a format which displays text corresponding to characters associated with each text input provided within the text input window as normal text and a visual indicator associated with the selected relevant information,
wherein the visual indicator associated with the selected relevant information modifies the normal text associated with the selected entity text.

US Pat. No. 10,394,864

METHOD AND SERVER FOR EXTRACTING TOPIC AND EVALUATING SUITABILITY OF THE EXTRACTED TOPIC

FOUNDATION OF SOONGSIL UN...

1. A topic extraction server comprising:a text preprocessing unit configured to extract a plurality of nouns from a document group according to classification information and remove a stopword from the extracted nouns;
a keyword extraction unit configured to calculate a first weight of each noun of the nouns in which the stopword is removed and extract a plurality of keywords from the nouns based on the first weight of each noun, wherein the first weight of each noun corresponds to the frequency of each noun in the document group;
a seed selection unit configured to calculate a second weight of each keyword of the extracted keywords and select a seed, among the extracted keywords corresponding to the document group according to the classification information, by clustering the extracted keywords and using the calculated second weight of each keyword of the extracted keywords, wherein the second weight of each keyword corresponds to the frequency of each corresponding document showing the each keyword;
an initial clustering unit configured to generate a cluster including the selected seed and a keyword shown in a sentence including the selected seed; and
a cluster combination unit configured to generate a topic group in accordance with classification by combining two or more clusters of a plurality of clusters generated by the initial clustering unit.

US Pat. No. 10,394,863

IDENTIFYING A STALE DATA SOURCE TO IMPROVE NLP ACCURACY

International Business Ma...

1. A system, comprising:a computer processor; and
a memory containing a program that, when executed on the computer processor, performs an operation comprising:
receiving a query for processing by a natural language processing (NLP) system comprising a corpus containing data ingested from a plurality of data sources, wherein the data is formatted and stored into one or more objects and organized based on topic changes, and wherein the ingestion is performed by at least one hardware resource of the NLP system;
identifying a data source expected to contain an answer to the query using NLP, by:
dividing words in the query into different elements,
generating an annotation for each of the elements using the NLP system by determining a particular topic describing each of the elements, and
identifying a previously ingested data source in the corpus that is associated with previously-generated annotations matching the generated annotations for the elements;
upon determining that the previously ingested data in the corpus does not contain the answer to the query, determining whether new material has been added to the identified data source since the last time the identified data source was ingested into the corpus;
upon determining that new material has been added to the identified data source since the last time the identified data source was ingested into the corpus:
re-ingesting the identified data source whereby the new material is inserted into the corpus; and
processing the query to determine a lexical answer type for the query, based at least in part on a concept assigned to each of the elements, wherein the concepts were determined and assigned using NLP, and wherein the lexical answer type is a word or noun phrase that predicts a type of an answer to the query; and
generating an answer to the query based on the new material inserted into the corpus and based on the lexical answer type.

US Pat. No. 10,394,862

METHOD AND SYSTEM FOR SEMANTICALLY QUERYING A DATABASE BY A MACHINE-TO-MACHINE APPLICATION

NEC CORPORATION, Tokyo (...

1. A processor-implemented method for semantically querying a database by a machine-to-machine application, wherein the database comprises hierarchically structured machine-to-machine resources, and semantic information is annotated to at least one resource, the method comprising:analysing, by a semantic engine, a semantic query issued for the database;
translating, by the semantic engine, the analysed semantic query into one or more queries satisfying a communication protocol of the hierarchical resource structure of the database; and
providing the translated one or more queries to the database as a query result,
wherein the semantic information includes a property or an attribute added to the at least one resource and represents relations to or between machine-to-machine resources.

US Pat. No. 10,394,861

NATURAL LANGUAGE PROCESSOR FOR PROVIDING NATURAL LANGUAGE SIGNALS IN A NATURAL LANGUAGE OUTPUT

INTERNATIONAL BUSINESS MA...

1. A speech synthesis (SS) system configured to convert natural language inputs to natural language outputs and provide a natural language alert that communicates that the natural language outputs may contain error, the SS system comprising:a memory having disfluency natural language data stored therein; and
a processor-based input/output module system communicatively coupled to the memory;
wherein the input/output module comprises a natural language input module communicatively coupled to a machine translation module;
wherein the input/output module further comprises a natural language output module communicatively coupled to the machine translation module;
wherein the input/output module is configured to:
receive, using the natural language input module, a natural language input;
convert, using the natural language input module, the natural language input to natural language input data;
perform, using the machine translation module, a natural language analysis operation on the natural language input data to generate natural language output data;
wherein the natural language analysis operation comprises performing a confidence level analysis on at least one portion of the natural language analysis operation to generate at least one confidence level that the natural language output data generated using the natural language analysis operation contains error;
wherein the natural language analysis operation further comprises, based at least in part on the at least one confidence level that the natural language output data contains an error, selecting a portion of the disfluency natural language data stored in the memory and embedding the selected portion of the disfluency natural language data into the natural language output data;
wherein the selected portion of the disfluency natural language data is embedded into the natural language output data in a location selected to communicate that a portion of the natural language output data may contain an error; and
convert, using the natural language output module, the natural language output data that has been embedded with the selected portion of the disfluency natural language data into speech or text.

US Pat. No. 10,394,859

SYSTEMS AND METHODS FOR PROCESSING AND DISPLAYING TIME-RELATED GEOSPATIAL DATA

Palantir Technologies Inc...

1. A system for processing time-related geospatial data from one or more data sources, the system comprising:an application server; and
a storage;
wherein the application server is configured to:
receive data including temporal information and geospatial information for each data object of one or more data objects;
send the data to a client device to display the data on a map;
generate one or more first multi-dimensional tiles based at least in part on the temporal information and the geospatial information, the one or more first multi-dimensional tiles corresponding to a temporal dimension associated with a first temporal width;
send the one or more first multi-dimensional tiles to store in the storage for retrieval by the client device;
generate one or more second multi-dimensional tiles based at least in part on the one or more first multi-dimensional tiles, the one or more second multi-dimensional tiles corresponding to the temporal dimension associated with a second temporal width; and
store the one or more second multi-dimensional tiles in the storage for retrieval by the client device;
wherein the first temporal width is smaller than the second temporal width.

US Pat. No. 10,394,858

UTILIZATION OF THIRD PARTY NETWORKS AND THIRD PARTY UNMANNED AERIAL VEHICLE PLATFORMS

Verizon Patent and Licens...

1. A method, comprising:receiving, by a device and via a first network, network connectivity information from an unmanned aerial vehicle;
identifying, by the device, a second network or another device based on the network connectivity information;
determining, by the device and based on identifying the second network or the other device, whether to hand over control of the unmanned aerial vehicle to the other device;
handing off, by the device, control of the unmanned aerial vehicle to the other device based on determining to hand over control of the unmanned aerial vehicle to the other device; and
providing, by the device, flight path instructions to the other device based on handing off control of the unmanned aerial vehicle to the other device.

US Pat. No. 10,394,855

GRAPH-MODELED DATA PROCESSING IN A RELATIONAL DATABASE

SAP SE, Walldorf (DE)

1. A system comprising:at least one data processor; and
at least one memory storing instructions which, when executed by the at least one data processor, result in operations comprising:
receiving, from a first user, a request to define a graph algorithm operating on a graph workspace, the graph workspace comprising a database object within a relational database, the graph workspace including at least a portion of graph-modeled data stored at the relational database, and the graph algorithm operating on at least the portion of the graph-modeled data within the relational database;
applying a first security rule associated with the relational database, the applying comprising determining whether the first user has a privilege to define the graph algorithm operating on the graph workspace within the relational database; and
storing, at the relational database, the graph algorithm at the relational database in response to the first user being determined to have the privilege to define the graph algorithm operating on the graph workspace.

US Pat. No. 10,394,854

INFERRING ENTITY ATTRIBUTE VALUES

1. One or more computer-readable storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to infer entity attribute values, the instructions configured to:receive, at a search engine, a search query issued at a user computing device;
receive, over a web-based computer network and in response to the receiving of the search query, data from multiple heterogeneous data sources, the data including a plurality of entity attribute values each associated with an entity and an attribute, the attribute having an associated attribute type and an attribute confidence score, the heterogeneous data sources corresponding to various sources distributed across the web-based computer network;
create a partial-to-attribute graph that includes the plurality of entity attribute values and associated entities, a partial being a set of attributes and their corresponding attribute values for a particular entity;
create a partial-to-partial similarity graph based upon attribute overlap in the partial-to-attribute graph;
identify a specific partial corresponding to a first entity in the partial-to-partial similarity graph, the specific partial including a missing attribute for the first entity, wherein the missing attribute is not located within any of the heterogeneous data sources;
based on the attribute overlap in the partial-to-attribute graph, infer a possible value for the missing attribute for the first entity by identifying, in aggregate across one or more spatially proximate partials, values associated with the missing attribute; and
based at least in part on the inferring of the possible value for the missing attribute and the search query, output for display on the user computing device, a search engine result page that includes the possible value.

US Pat. No. 10,394,853

PROVIDING A SELF-MAINTAINING AUTOMATED CHAT RESPONSE GENERATOR

Qualtrics, LLC, Provo, U...

20. A system comprising:at least one processor; and
a non-transitory computer readable medium comprising instructions thereon that, when executed by the at least one processor, cause the system to:
analyze a digital content body comprising a plurality of content portions to identify, from within the plurality of content portions, content terms corresponding to a plurality of content topics;
analyze a chat history comprising a plurality of chat messages from one or more client devices to identify, from within the plurality of chat messages, chat terms corresponding to the plurality of content topics;
determine relational rules between the content terms, between the chat terms, and between the content terms and the chat terms;
generate a language model to map the relational rules for generating responses to chat questions;
monitor the digital content body and the chat history to detect a change within at least one of the plurality of content portions of the digital content body or a change within the chat history; and
in response to detecting the change within the at least one of the plurality of content portions or the change within the chat history, generate an updated language model that comprises one or more updated relational rules between the content terms, between the chat terms, and between the content terms and the chat terms;
receive a chat question originating from a client device; and
determine a response to the chat question based on the updated language model.

US Pat. No. 10,394,852

CUSTODIAN DISAMBIGUATION AND DATA MATCHING

International Business Ma...

1. A computer-implemented method for matching different user representations of a person in a plurality of computer systems, the method comprising:grouping information sets into indexing buckets with user names as sort keys using a non-phonetic algorithm, wherein the non-phonetic algorithm does not use any of a sound and a pronunciation of the information sets in order to recognize the information sets, wherein the user names are used to access different applications on a plurality of computer systems;
determining a total similarity score by determining:
a similarity score for each pair of corresponding attributes of each pair of information sets in each of the indexing buckets, and
a similarity score for each pair of information sets in each of the indexing buckets by:
using a longest common sub-string algorithm to generate an output; and
using any of an Overlap coefficient and a Dice coefficient on the output of the longest common sub-string algorithm;
merging information of each pair of information sets classified as matches based on each total similarity score; and
using the merged information to identify a user and access to data by that user for performing a hold on the data.

US Pat. No. 10,394,849

CASCADED DISCOVERY OF INFORMATION ENVIRONMENT

EMC IP Holding Company LL...

1. In a networked environment, a system operable to perform information management in the networked environment, the system comprising:a database stored in a storage device;
a processor configured to execute:
a discovery module operable to facilitate the discovery of environment objects that are present in the networked environment and discovery of information concerning a discovered environment object, the discovery module also operable to store, in the database, discovered information associated with a discovered environment object, wherein the discovery module is further operable to discover software applications operating in the networked environment; and
a plurality of adapters that provide an interface between the discovery module and a network and that are operable to collectively perform cascaded discovery concerning an environment object, and the adapters are also operable to collect information discovered about a discovered environment object, the plurality of adapters including:
a first adapter operable to perform a first discovery process for discovering environment objects connected to the networked environment including a first environment object and for discovering first information concerning the first environment object, the first information including whether the first environment object acts like a server in the networked environment;
a second adapter operable to perform a second discovery process with respect to the first environment object, wherein the second discovery process uses the first information previously discovered by the first adapter about the first environment object as a basis for performing further discovery about the first environment object to discover second information about the first environment object, wherein the second information is different from the first information; and
a third adapter operable to discover services operating in the networked environment, wherein the services includes an application and hardware and wherein the third adapter identifies data that is consistent with the application and identifies communicating components of the services by examining communications to the services that occur over the networked environment;
a classifier operable to classify data objects in the networked environment, wherein the classifier categorizes each of the data objects based on first metadata collected from the data objects and second metadata that is generated from the data objects and the information about the environment objects and the software applications discovered by the discovery module and the plurality of adapters by applying rules to the data objects such that each data object is associated with one or more categories;
a coordinator operable to identify service level objectives for each of the data objects based on the assigned categories, wherein the coordinator selects services for the data objects based on the service level objectives; and
an orchestrator that performs the services.

US Pat. No. 10,394,848

GENERATING A MULTI-COLUMN INDEX FOR RELATIONAL DATABASES BY INTERLEAVING DATA BITS FOR SELECTIVITY

Amazon Technologies, Inc....

1. A distributed data warehouse system, comprising:a plurality of compute nodes, each comprising one or more hardware processors, implementing:
one or more persistent storage devices providing storage for a columnar relational database table, wherein the one or more persistent storage devices comprise a plurality of data blocks;
a multi-column key generator, configured to:
identify at least two columns of a plurality of columns of the columnar relational database table; and
generate a multi-column index for the columnar relational database table based, at least in part, on an interleaving of respective data bits for selectivity from respective portions of respective data values from the identified at least two columns, wherein said multi-column index provides a respective index value for each entry of a plurality of entries of the columnar relational database table;
a write module, configured to:
direct the one or more persistent storage devices to store the plurality of entries of the columnar relational database table, wherein the plurality of entries of the columnar relational database table are directed to be stored in one or more of the plurality of data blocks of the one or more persistent storage devices in sorted order according to the respective index value for each of the plurality of entries; and
direct the one or more persistent storage devices to store metadata indicating multi-column index value ranges corresponding to the index values of the respective entries stored in each of the one or more data blocks.

US Pat. No. 10,394,847

PROCESSING DATA IN A DISTRIBUTED DATABASE ACROSS A PLURALITY OF CLUSTERS

Adobe Inc., San Jose, CA...

1. A method of managing data within a multi-cluster database comprising:receiving a request to process a piece of data, the piece of data having an associated identifier;
determining, by at least one processor, a first key identifier of a first key space for the piece of data based on the associated identifier by performing a hash on the associated identifier and calculating the first key identifier of the first key space using a first set of bits of the hash;
identifying, from among a plurality of database clusters, a database cluster for processing the request using the first key identifier;
determining, by the at least one processor, a second key identifier of a second key space for the piece of data based on the associated identifier;
identifying, from among a plurality of database nodes of the identified database cluster, a database node for processing the request using the second key identifier; and
routing the request to the identified database node of the identified database cluster.

US Pat. No. 10,394,846

HETEROGENEOUS COMPRESSION IN REPLICATED STORAGE

INTERNATIONAL BUSINESS MA...

1. A method for data management in a replicated storage environment, by a processor device, comprising:storing a plurality of data replicas under a plurality of heterogeneous compression algorithms, wherein one of the data replicas is optimized for a data operation, the one of the data replicas optimized for the data operation identified by determining a first one of the data replicas stored under a first one of plurality of heterogeneous compression algorithms more efficiently executes the data operation when compared to performing the data operation using a second one of the data replicas stored under a second one of the plurality of heterogeneous compression algorithms; and
performing the data operation using the identified one of the data replicas optimized for the data operation; wherein the data operation is a data read operation and the identified one of the data replicas is chosen for the data read operation according to when metadata associated with a data read request for the data read operation indicates the data read request comprises a short random read and when the metadata indicates the data read request comprises a long sequential read such that the one of the plurality of heterogeneous compression algorithms the identified one of the data replicas is stored under is chosen to complete the data read operation according to whether the data read request comprises the short random read or the long sequential read.

US Pat. No. 10,394,845

METHOD AND SYSTEM FOR TUNING BLOCKCHAIN SCALABILITY FOR FAST AND LOW-COST PAYMENT AND TRANSACTION PROCESSING

Vijay K. Madisetti, John...

1. A method of synchronizing transactions between blockchains comprising:receiving a first plurality of transactions on a first private blockchain network;
recording the first plurality of transactions to a first private block on the first private blockchain network;
receiving a second plurality of transactions on the first private blockchain network;
recording the second plurality of transactions to a second private block on the first private blockchain network;
generating a first merged block comprising the first private block and the second private block;
recording the first merged block to a single block on a second blockchain network;
recording each of the first private block, the second private block, and the first merged block to a smart contract linked to the first private blockchain network, defining a first private smart contract; and
performing a synchronization process between the first private smart contract and a second smart contract linked to the second blockchain network, defining a second smart contract.

US Pat. No. 10,394,843

METHOD AND APPARATUS FOR PERSONAL ASSET MANAGEMENT

HERE Global B.V., Veldho...

1. A method for controlling personal asset management, the method comprising:determining, utilizing at least one processor, one or more devices associated with a user to be part of one or more groups,
wherein the one or more devices include one or more computing devices and one or more assets,
wherein the one or more assets are respectively tagged with one or more short range wireless asset management tags and respectively associated with one or more personal cloud endpoints;
determining one or more datasets associated with the user to be collected at and made accessible by the one or more devices that are part of the one or more groups,
wherein the one or more datasets include computation closures and personal data associated with one or more devices and the one or more assets, and the computation closures and the personal data are formatted based on a resource description framework;
initiating a synchronization of the one or more datasets among the one or more personal cloud endpoints of the one or more assets and one or more other cloud storage endpoints of the one or more devices that are part of the one or more groups via a cryptographic connection established between the one or more devices, by
encrypting and transmitting the formatted computation closures and the formatted personal data via the cryptographic connection, and then
receiving and decrypting the encrypted formatted computation closures and the encrypted formatted personal data at the one or more devices;
establishing a connection between the determined devices that are part of the one or more groups;
initiating a presentation via at least one user interface providing an access to the user and enabling an update and/or a sharing of at least some part of the synchronized one or more datasets while controlling the formatted personal data; and
managing, utilizing the at least one interface, the synchronized one or more datasets and/or the one or more connected devices that are part of the one or more groups.

US Pat. No. 10,394,842

BOUNDARY-BASED DATA CONVERSION

Workday, Inc., Pleasanto...

1. A system for data conversion, comprising:an interface to receive an indication to convert a set of data; and
a processor to:
determine a plurality of subsets of the set of data based at least in part on a boundary condition, wherein the boundary condition comprises one of a temporal boundary or a transactional boundary, wherein the determining of the plurality of subsets of the set of data comprises to:
determine whether a piece of data of the set of data satisfies the boundary condition; and
assign the piece of data to a first subset of data or a second subset of data based on whether the piece of data satisfies or does not satisfy the boundary condition, respectively, the plurality of subsets including the first subset of data and the second subset of data;
convert one of the plurality of subsets of data to a converted subset of data, wherein converting the one of the plurality of subsets of data comprises traversing unconverted data objects of the one of the plurality of subsets of data by one or more data traversers, wherein the one subset of data is converted before another subset of data; and
provide the converted subset of data.

US Pat. No. 10,394,841

GENERATING CONTEXTUAL SEARCH PRESENTATIONS

Google LLC, Mountain Vie...

1. A method comprising:obtaining a first selection data identifying one or more words selected by a user from a document displayed to the user in a user interface of a user device;
obtaining context data comprising one or more words in the document other than the one or more words of the first selection data;
providing the first selection data and the context data to an entity disambiguation system that is configured to determine, based on the first selection data and the context data, whether the selection data identifies an entity;
receiving data indicating that the first selection data identifies an entity from the entity disambiguation system;
in response to receiving data from the entity disambiguation system indicating that the first selection data identifies an entity:
obtaining an entity-type special contextual search presentation that is formatted specifically to display content relevant to an entity for the first selection data from among a plurality of contextual search presentations that includes (i) the entity-type special contextual search presentation and (ii) one or more contextual search presentations that are formatted differently from the entity-type special contextual search presentation; and
providing the entity-type special contextual search presentation for display in the user interface of the user device.

US Pat. No. 10,394,840

SOCIAL NETWORK CONTENT ANALYSIS

International Business Ma...

1. A method comprising:receiving one or more updates in a social networking system corresponding to one or more topics;
determining user constraints corresponding to a selected update of the received one or more updates;
updating a threshold value associated with each of the determined user constraints;
calculating a constraint score corresponding to each of the determined user constraints, wherein the constraint scores include:
an author score, which is calculated as a ratio of a number of updates from the selected update's author the user has interacted with to the total number of updates provided by the author;
a topic score, which is calculated as a ratio of a number of updates with similar content to the selected update that the user has interacted with to a total number of updates in a user's stream with similar content;
a time score, which is calculated as a ratio of an estimated amount of time the user would spend reading the selected update to an amount of time the user is willing to spend reading an update; and
a repetition score;
determining whether each of the constraint scores meets the corresponding updated threshold value; and
presenting the update responsive to determining that each of the constraint scores meets the corresponding updated threshold value.

US Pat. No. 10,394,835

RAPID ACCESS INFORMATION DATABASE (RAID) SYSTEM AND METHOD FOR GENERALIZED DATA AGGREGATION FOR A PLETHORA OF DATA TYPES AND USERS

1. A computer implemented rapid access information database (RAID) portal system for data collection and aggregation, said system comprising:a rapid access information database (RAID) portal comprised of one or more central RAID servers configured to access directly or with assistance to external data, said RAID servers isolated from direct user access and configured to establish a pre-authorized and approved direct or assisted interface to one or more external proprietary services having systems and databases to obtain either permanent or transient data elements within said proprietary services; said proprietary services servers or assisted access forming a network (RAID NET);
interfacing components for data owners or authorized agents to access said RAID portal system and legally authorize the level and conditions under which said permanent or transient data elements residing in said one or more proprietary services databases may be accessed directly or with assistance and provided through said RAID portal system;
interfacing and action originating components allowing said data owners or authorized agents to define and initiate a broadcast or query about the permanent or transient data elements for one or more of their data types retained by said RAID portal to said RAID NET;
communication components for secure interfacing to said RAID portal by data owners, authorized agents or their intermediaries utilizing said RAID portal system defined access practices;
legal clearance components to establish the valid specific legal level of access of each said intermediary to each said permanent or transient RAID NET stored data elements and to approve or deny said intermediary's access to said permanent or transient data elements; and
RAID portal components to aggregate, locate, and compare any responses about said permanent or transient data elements from said RAID NET and communicate appropriate permanent or transient data elements to the appropriately cleared data owner, authorized agent or their intermediaries.

US Pat. No. 10,394,832

RANKING SEARCH RESULTS DOCUMENTS

GOOGLE LLC, Mountain Vie...

1. A method implemented by one or more processors, comprising:generating a graph including a plurality of nodes, wherein the plurality of nodes include a plurality of query feature nodes and a plurality of document feature nodes, and wherein at least one of the query feature nodes is connected to at least one of the document feature nodes;
receiving a query, the query being entered by a user via a user interface input device of a computing device of the user;
identifying responsive documents that are responsive to the query, wherein the responsive documents include an email sent to an email address of the user;
identifying one or more document features for the email, each of the one or more document features represented in the graph by a corresponding one of the document feature nodes, and the document features comprising at least one email feature that is based on at least one of:
From content, based on its presence in a From field of the email, and
Subject content, based on its presence in a Subject field of the email;
identifying one or more query features for the query, each of the one or more query features represented in the graph by a corresponding one of the query feature nodes;
generating a query dependent measure for the email based on measures of past interactions between the query features and the document features represented in the graph,
wherein each of a plurality of the measures is based on a quantity of the past interactions, by corresponding users, with other documents having one or more of the document features when the other documents were presented in response to corresponding queries having one or more of the query features, and
wherein the other documents are restricted to a plurality of non-accessible documents that are not accessible to the user;
using the query dependent measure for the email to determine a presentation characteristic for presenting an email search result that corresponds to the email; and
providing, in response to the query, the email search result for presentation with the presentation characteristic, the presentation being via a user interface output device of the computing device.

US Pat. No. 10,394,830

SENTIMENT DETECTION AS A RANKING SIGNAL FOR REVIEWABLE ENTITIES

GOOGLE LLC, Mountain Vie...

1. A computer-implemented method, comprising:monitoring a plurality of user interactions of multiple users with entity search results provided in response to multiple search queries issued by the multiple users, each of the entity search results being associated with a given entity and being for a corresponding document that contains information about the given entity, wherein the given entity is a particular member of an entity type having a plurality of members, and wherein the given entity is a uniquely identifiable person or place;
generating one or more metrics for the user interactions of the multiple users with the entity search results including user interactions of the multiple users with a first search result of the entity search results and user interactions of the multiple users with a second search result of the entity search results;
determining, for each of a plurality of the entity search results including the first search result and the second search result, a corresponding likelihood that the entity search result is about the given entity, wherein determining the corresponding likelihood for the first search result is based on a number of times the given entity is mentioned in the first search result;
generating an entity score of the given entity based at least in part on:
the metrics for the user interactions of the multiple users with the entity search results, including user interactions of the multiple users with the first search result of the entity search results and user interactions of the multiple users with the second search result of the entity search results, and
the corresponding likelihoods that the entity search results are about the given entity; and
storing the entity score of the given entity in a database.

US Pat. No. 10,394,829

CONTENT AUTHORING

International Business Ma...

1. A method, in an information handling system comprising a processor and a memory, for identifying concepts, the method comprising:generating, by the system, at least a first concept set comprising one or more candidate concepts extracted from one or more content sources;
processing, by the system, one or more user concepts contained in written content authored by the user;
generating or retrieving, by the system, a vector representation of each user concept and each candidate concept in the first concept set;
performing, by the system, a natural language processing (NLP) analysis comparison of the vector representation of each user concept to a vector representation of each candidate concept in the first concept set to determine a similarity measure between each candidate concept and each user concept by analyzing a vector similarity function sim(Vi,Vj) between (1) a vector representation Vi of a first selected user concept Ci contained in written content authored by the user and (2) one or more vectors Vj for each candidate concept in the first concept set, wherein i and j are positive integer values; and
selecting, by the system, one or more of the candidate concepts for display as recommended concepts which are related to the one or more user concepts contained in written content authored by the user based on the similarity measure between each candidate concept and each user concept and which are restricted to a specific area of relatedness with respect to the first selected concept Ci, where the one or more candidate concepts are selected by constructing a ranked list of M candidate concepts sorted by similarity measure for display as the recommended concepts, where M is a user specified concept identification parameter that is a positive integer value.

US Pat. No. 10,394,828

METHODS, SYSTEMS AND COMPUTER READABLE STORAGE MEDIA FOR GENERATING QUANTIFIABLE GENOMIC INFORMATION AND RESULTS

Emory University, Atlant...

1. A method of generating comparable genomic information from a plurality of raw genomic datasets, comprising:processing at least one dataset that includes raw genomic data and descriptive data obtained from a data repository to generate one or more groups of one or more genes from the raw genomic data and to extract experiment data from the descriptive data for the at least one dataset;
generating quantitative information for each group of one or more genes of the at least one dataset based on the experiment data and/or one or more genomic coordinate systems for each of the one or more genomic coordinate systems;
wherein the one or more genomic coordinate systems includes a genomic region coordinate system and a gene coordinate system;
wherein each coordinate in the gene coordinate system relate to individual genes and each coordinate in genomic region coordinate system relates to a fixed interval of base pairs; and
wherein the generating quantitative information for each group of one or more genes of the at least one dataset includes:
determining one or more quantitative measures of one or more biological properties for each group of one or more genes of the at least one dataset based on the experiment data and/or one or more genomic coordinate systems for each of the one or more genomic coordinate systems;
generating a score information based on the one or more quantitative measures of one or more biological properties for each group of genes with respect to each genomic coordinate system and the at least one dataset, the score information for each group of genes corresponding to a normalized value corresponding to the one or more quantitative measures of one or more biological properties for each group of one or more genes with respect to each coordinate system and the at least one dataset; and
generating a rank information from the score information for each group of one or more genes with respect to the coordinate system and the at least one dataset, the rank information corresponding to a ranking of the score information for each group of one or more genes within each dataset and coordinate system; and
storing the quantitative information for each group of the one or more genes of the at least one dataset in at least one database, wherein the quantitative information are stored with respect each coordinate system separately in the at least one database.

US Pat. No. 10,394,827

DISCOVERING ENTERPRISE CONTENT BASED ON IMPLICIT AND EXPLICIT SIGNALS

Microsoft Technology Lice...

1. A method for providing an aggregated view of content items, the method comprising:receiving an indication to display an aggregated view of content items relevant to a user;
determining one or more content items from one or more repositories to display according to a relevance ranking, based on an activity by the user or other users and a relationship associated with the user and the activity, the activity being weighted according to the relationship;
generating a user interface for displaying the one or more content items; and
displaying visual representations of the one or more content items in an order according to the relevance ranking, each of the visual representations providing activity insights relating to at least one action by the user or other users with a content item, each visual representation having an associated tag providing personalized information that specifies at least one activity performed on one or more content items and how the at least one activity relates to the user, wherein the tag is selectable for initiating a predefined search query relating to the at least one activity specified by the personalized information, wherein initiation of the predefined search query results in aggregation and displaying of additional content items relating to the activity and not already included in the displayed visual representations.

US Pat. No. 10,394,824

PROVIDING RESULTS TO PARAMETERLESS SEARCH QUERIES

GOOGLE LLC, Mountain Vie...

1. A method comprising:determining, by a computing system and based at least in part on information included in at least one electronic communication associated with a user of a mobile computing device, a context of the mobile computing device;
responsive to determining the context, executing, by a computing system, based at least in part on the context of the mobile computing device, an inferred parameter query to identify one or more results determined to be relevant to the user of the mobile computing device; and
sending, by the computing system, to the mobile computing device, the one or more results.

US Pat. No. 10,394,823

DETECTION AND UTILIZATION OF ATTRIBUTES

International Business Ma...

1. A method of improving detection and utilization of attributes of a user, said method comprising:sending, by a computer processor, a query to a device operated by a user of the device, wherein the query includes a query database having:
a plurality of query tags corresponding to expected attributes of a target user; and
a numerical value associated with each of the plurality of query tags;
detecting a plurality of attributes of the user;
receiving, by the computer processor, data corresponding to the detected plurality of attributes of the user;
receiving, by the computer processor, a response from the user related to the query;
automatically incrementing based on the response, by the computer processor, the numerical value associated with each query tag of the plurality of query tags that corresponds to each detected attribute of the detected plurality of attributes;
creating, by the computer processor, a new query tag in the query tag database for each of the detected plurality of attributes that does not have a corresponding query tag in the query tag database;
storing, by the computer processor, a numerical value associated with each new query tag;
obtaining, by e computer processor, data related to whether the user of the device is responding to the query for another user;
creating, by the computer processor, a query tag associated with whether the user of the device is responding to the query for another user; and
storing, by the computer processor, a numerical value associated with the query tag associated with whether the user of the device is responding to the query for another user.

US Pat. No. 10,394,821

PROVIDING RECONSTRUCTED DATA BASED ON STORED AGGREGATE DATA IN RESPONSE TO QUERIES FOR UNAVAILABLE DATA

Cisco Technology, Inc., ...

1. A network computing apparatus, comprising:one or more processors;
a data analyzer configured to:
collect network stream data;
sort collected network stream data according to an index from a plurality of indexes;
partition the collected network stream data into a plurality of data clusters;
a data aggregator configured to:
determine for each cluster, of the plurality of data clusters, one or more distance values for each pair of points in that cluster, and adjusting contents of other clusters, of the plurality of data clusters, if any of the one or more distance values exceeds a distance threshold value;
for each cluster of the plurality of data clusters, determine an average point for that cluster;
a data reconstructor configured to:
upon receiving a request to reconstruct a data point for a particular coordinate, determine a reconstructed data point by interpolating, at the particular coordinate, between two or more average points of two or more clusters from the plurality of data clusters, wherein no two average points, of the two or more average points of two or more clusters from the plurality of data clusters, are from a same cluster of the two or more data clusters.

US Pat. No. 10,394,820

CONSTRUCTING AND QUERYING A BLOOM FILTER TO DETECT THE ABSENCE OF DATA FROM ONE OR MORE ENDPOINTS

INTERNATIONAL BUSINESS MA...

1. A computer-implemented method, comprising:determining one or more characteristics of an overall Bloom filter representing a set of legal parameter values of a plurality of parameters useable for querying one or more endpoints, wherein in the overall Bloom filter, each parameter of the plurality of parameters is offset based on a respective unique identifier of the parameter, wherein the determining the characteristics of the overall Bloom filter comprises determining a hash function, a number of bits used to represent each endpoint Bloom filter, and a number of active bits for each parameter represented in each endpoint key;
requesting from each endpoint of the one or more endpoints a respective endpoint Bloom filter having the one or more characteristics and representing legal parameters values of the endpoint, wherein each request includes the determined hash function, the number of bits used to represent a corresponding Bloom filter and the number of active bits for each parameter;
receiving one or more endpoint Bloom filters from the one or more endpoints, wherein in each endpoint Bloom filter, each parameter of the plurality of parameters is offset based on the respective unique identifier of the parameter;
combining the one or more endpoint Bloom filters into the overall Bloom filter;
determining a first set of desired parameter values corresponding to first desired data to be retrieved from a first endpoint of the one or more endpoints;
constructing, by a computer processor, a first query Bloom filter representing the first set of desired parameter values;
performing a first Bloom filter search of the first query Bloom filter against the overall Bloom filter; and
responsive to not finding a match through the first Bloom filter search, opting not to query the first endpoint with the first set of desired parameter values.

US Pat. No. 10,394,819

CONTROLLING MIRRORING OF TABLES BASED ON ACCESS PREDICTION

INTERNATIONAL BUSINESS MA...

1. A system for managing a plurality of data storage devices comprising a plurality of volumes storing a database, the system comprising:at least one processor; and
at least one memory storing computer-executable instructions,
wherein the at least one processor is configured to access the at least one memory and execute the computer-executable instructions to:
identify and execute an access instruction for accessing the database, wherein the access instruction is a structured query language (SQL) statement;
identify a first table to be accessed based at least in part on the access instruction;
identify a first one or more volumes of the plurality of volumes that contains the first table;
set the identified first one or more volumes as mirroring targets;
determine that a second one or more volumes of the plurality of volumes are not being accessed and are currently being mirrored from a first data storage device of the plurality of data storage devices to a second data storage device of the plurality of data storage devices;
responsive at least in part to receiving mirroring instructions based on a determination that the determined second one or more volumes are more than or equal to a number of the mirroring targets, cancel mirroring of the determined second one or more volumes;
initiate mirroring of the first one or more volumes from the first data storage device to the second data storage device;
responsive at least in part to the initiating mirroring, identify an access order based at least in part on an access history associated with the database, wherein the identifying the access order comprises predicting that a second table is to be accessed after the first table, wherein the predicting comprises determining, based at least in part on the access history, that the second table is historically accessed after the first table at an access frequency in the access history that exceeds a threshold value; and
determine that a third one or more volumes of the plurality of volumes contains the second table; and
initiate mirroring of the third one or more volumes from the first data storage device to the second data storage device after the initiating mirroring of the first one or more volumes based at least in part on determining that the second table is historically accessed after the first table at the access frequency that exceeds the threshold value.

US Pat. No. 10,394,818

SYSTEM AND METHOD FOR DYNAMIC DATABASE SPLIT GENERATION IN A MASSIVELY PARALLEL OR DISTRIBUTED DATABASE ENVIRONMENT

ORACLE INTERNATIONAL CORP...

1. A method for dynamic database split generation in a massively parallel or other distributed database environment including a plurality of databases and a data warehouse layer providing querying of the plurality of databases and data summarization of the plurality of databases in a table, the method comprising:obtaining by a database table accessor executing on one or more microprocessors, from an associated client application, a query for data in the table of the data warehouse layer, the query comprising query data representative of a user query and user splitter kind preference data representative of a user split preference specifying how an associated user would prefer the table to be split for performing the query for data;
obtaining table data representative of one or more properties of the table, the table data comprising table size data representative of a total size of the table;
selecting a splits generator from among an enumeration of splitter kinds in accordance with:
the user split preference when it is determined by the database table accessor that splitting the table using the user split preference would improve a performance of the query for data relative to splitting the table based on the one or more properties of the table, or
the one or more properties of the table when it is determined by the database table accessor that splitting the table based on the one or more properties of the table would improve the performance of the query for data relative to splitting the table based on the user split preference;
generating, by the selected splits generator, table splits dividing the user query into a plurality of query splits; and
outputting the plurality of query splits to an associated plurality of mappers for execution by the associated plurality of mappers of each of the plurality of query splits as tasks of a selected data processing framework against the table.

US Pat. No. 10,394,817

SYSTEM AND METHOD FOR IMPLEMENTING A DATABASE

WALMART APOLLO, LLC, Ben...

1. A system comprising:a load balancer;
a database partitioned into at least a first shard, a second shard, and a third shard;
a first plurality of database servers coupled to the load balancer, each database server in the first plurality of database servers hosting a copy of the first shard of the database;
a second plurality of database servers coupled to the load balancer, each database server in the second plurality of database servers hosting a copy of the second shard of the database;
a third plurality of database servers coupled to the load balancer, each database server in the third plurality of database servers hosting a copy of the third shard of the database;
a first server set comprising one database server from the first plurality of database servers, one database server from the second plurality of database servers, and one database server from the third plurality of database servers; and
a second server set comprising one database server from the first plurality of database servers, one database server from the second plurality of database servers, and one database server from the third plurality of database servers, wherein:
the load balancer is configured to:
send incoming instructions to a database server selected from the first plurality of database servers, the second plurality of database servers, or the third plurality of database servers, using load balancing techniques;
receive a first query result from one of the database servers in the first plurality of database servers;
receive a second query result from one of the database servers in the second plurality of database servers;
aggregate the first query result and the second query result; and
present an aggregated query result to a requestor that triggered the incoming instructions;
each database server in the first plurality of database servers is configured to process at least one first instruction of the incoming instructions and send queries of the first shard of the database to only a specific database server in the first plurality of database servers;
each database server in the second plurality of database servers is configured to process at least one second instruction of the incoming instructions and send queries of the second shard of the database to only a specific database server in the second plurality of database servers;
each database server in the first server set is configured to send queries to only other database servers in the first server set;
each database server in the second server set is configured to send queries to only other database servers in the second server set; and
each database server in a third server set is configured to send queries to only other database servers in the third server set.

US Pat. No. 10,394,816

DETECTING PRODUCT LINES WITHIN PRODUCT SEARCH QUERIES

GOOGLE LLC, Mountain Vie...

1. A computer-implemented method to determine new product lines from unknown search terms in product searches, comprising:receiving, using one or more computing devices, a first product query comprising first search terms;
classifying, using the one or more computing devices, the first product query to identify a product category for the first product query;
identifying, using the one or more computing devices, a brand corresponding to the first product query, the brand being selected from a list of known brands for the product category and being based on one or more of the first search terms;
retrieving, using the one or more computing devices, a known attribute list for the product category;
identifying, using the one or more computing devices, one or more unknown terms within the first product query that do not correspond to the known attribute list for the product category;
classifying, using the one or more computing devices, the one or more unknown terms not corresponding to the known attribute list as unknown product line terms based on comparing the one or more terms against known product line templates comprising known product lines corresponding to known brands;
computing, using the one or more computing devices, a metric indicating a correspondence of the unknown product line terms to an actual product line within the brand, wherein computing the metric comprises determining a total number of other product queries comprising the unknown product line terms;
determining, using the one or more computing devices, that the metric exceeds a predefined threshold;
designating, using the one or more computing devices, the unknown product line terms as a new product line for the brand in response to determining that the metric exceeds the specified threshold;
performing, using the one or more computing devices, a product search for the new product line using the first product query to obtain first search results;
refining, using the one or more computing devices, the first search results based on the new product line to obtain second search results; and
returning, using the one or more computing devices, search results according to the product search for the new product line.

US Pat. No. 10,394,815

JOIN WITH PREDICTIVE GRANULARITY MODIFICATION BY EXAMPLE

MICROSOFT TECHNOLOGY LICE...

1. A computing device for computing join potential between a first table and a second table, comprising:a processor configured to:
execute an application program that instantiates the first table and the second table;
select at least one pair of columns, wherein each pair includes a source column of the first table and a target column of the second table;
for each pair:
detect that the columns in the pair contain respective data with different data granularities;
modify the data in one of the columns so that the modified data has the same data granularity as the data in the other column to facilitate generating corresponding matches between the source and target columns; and
generate an example that includes an element from the source column and a corresponding potential matching element from the target column;
for each example, based on a feature of the example programmatically generate a script that, when performed on the source column of the selected pair of columns of the example, produces a value that is consistent with the target column of the example, wherein the script defines a set of programmatic instructions to be executed within the application program;
for each script, apply that script to other elements in the source column and determine that an output generated by that script is in the target column;
for the script for which the generated output meets a selected matching criterion when compared to the elements of the target column, convey the output generated by that script for display on a display device; and
in response to an input signal accepting the script for which the output is conveyed, perform a join operation on the two tables at least in part by performing that script on the source column.

US Pat. No. 10,394,814

STORING NESTED COMPLEX DATA STRUCTURES IN A DATA STORE

Palantir Technologies Inc...

1. A data processing method providing an improvement in speed of obtaining, in response to a computer search query from one or more computing devices, a particular compressed data chunk that may include a particular data value that is digitally stored in a large data file, the method comprising the steps of:creating and digitally storing a digital file of sorted data comprising a first set of uncompressed metadata chunks, a second set of uncompressed metadata chunks, a set of compressed data chunks, and location metadata for the first set of metadata chunks at an end of the digital file; each chunk of the first and second sets of uncompressed metadata chunks comprising a set of bits; the set of compressed data chunks comprising a first compressed data chunk; the first compressed data chunk comprising a first set of values; the first set of uncompressed metadata chunks spaced evenly across the data file; the second set of uncompressed metadata chunks spaced evenly between a first metadata chunk of the first set of uncompressed metadata chunks and a second metadata chunk of the first set of uncompressed metadata chunks; the first metadata chunk comprising a first set of bits;
setting a first subset of bits of the first set of bits to indicate a minimum value of the first set of values, setting a second subset of bits of the first set of bits to indicate a maximum value of the first set of values, and setting a third subset of bits of the first set of bits to indicate a first portion of the data file separating the first metadata chunk and the second metadata chunk;
receiving the search query specifying the particular data value;
reading the first metadata chunk; in response to determining that the particular data value is equal to or greater than the minimum value and equal to or less than the maximum value, sending the first compressed data chunk to the one or more computing devices.

US Pat. No. 10,394,813

METHOD AND APPARATUS FOR PERFORMING QUERY AWARE PARTITIONING

1. A method for processing a query, the method comprising:receiving, via a processor, a query plan comprising a plurality of queries;
classifying, via the processor, each one of the plurality of queries;
computing, via the processor, an optimal partition set for each one of the plurality of queries;
reconciling, via the processor, the optimal partition set of each one of the plurality of queries with a subset of queries of the plurality of queries, wherein the reconciling is performed after the computing, wherein reconciling comprises;
testing the optimal partition set of each one of the plurality of queries against all other queries to ensure compatibility;
selecting an optimal partition set that is compatible with at least two queries of the plurality of queries and has a lowest cost based upon a lowest cost computation, wherein the lowest cost computation comprises a reconciled optimal partition set that provides a least amount of data transfer between a plurality of nodes, wherein a cost is defined as 0 when a query node of the query plan processes only local data, as an input rate of the query node when the query node is incompatible with the optimal partition set and as an output rate of the query node when the query node is compatible with the optimal partition set; and
using the optimal partition set for the at least two queries of the plurality of queries;
selecting, via the processor, the reconciled optimal partition set to be used by each query of the plurality of queries;
storing, via the processor, the reconciled optimal partition set in a computer readable medium;
applying, via the processor, the reconciled optimal partition set to the query plan to transform the query plan into an optimized query plan, wherein the applying the optimized query plan comprises:
assigning an operator to each node of a plurality of nodes that each node will execute, wherein at least two of the plurality of nodes perform different operators;
providing a parameter for each operator at each of the plurality of nodes; and
informing each node of the plurality of nodes a source and a destination of a data stream;
applying, via the processor, the optimized query plan to the data stream; and
outputting, via the processor, a result of the applying to a user.

US Pat. No. 10,394,812

CASE STATEMENT OPTIMIZATION

International Business Ma...

1. A machine-implemented method for performing optimization techniques of case expressions, the machine-implemented method comprising:analyzing, by at least one processing device, a case expression for redundant expressions, patterns equivalent to a built-in function, and specific functions to form a simplified expression, wherein the case expression is written in a language supported by a database management system;
optimizing, by the at least one processing device, the simplified expression based on a cost benefit evaluation of no optimization, native code generation, hashing inputs, and a results caching algorithm to form an execution plan, the optimizing further comprising:
evaluating the case expression to determine whether the case expression would benefit from caching or code generation, and
determining whether the case expression would benefit more from lightweight caching or heavyweight caching when the evaluating determines that the case expression would benefit from the caching, the determining depending upon a complexity of the case expression, whether inputs to the case expression are ordered, and a cardinality of the inputs; and
utilizing, by the at least one processing device, the execution plan in the database management system for the case expression.

US Pat. No. 10,394,810

ITERATIVE Z-SCORE CALCULATION FOR BIG DATA USING COMPONENTS

1. A computing-system-implemented method for generating a Z-score for a selected data element in a modified computation subset, the method comprising:initializing, by a computing-device-based computing system, a sum or a mean or both and one or more other components of a Z-score for a pre-modified computation subset, wherein the pre-modified computation subset contains a specified number, n (n?6), of data elements of a data set on at least one of one or more storage media in the computing-device-based computing system;
accessing, by the computing-device-based computing system and from the data set, a data element to be removed from the pre-modified computation subset and a data element from the data set to be added to the pre-modified computation subset;
modifying, by the computing-device-based computing system, the pre-modified computation subset by:
removing the to-be-removed data element from the pre-modified computation subset; and
adding the to-be-added data element to the pre-modified computation subset;
iteratively deriving, by the computing-device-based computing system, a sum or a mean or both for the modified computation subset;
directly iteratively deriving, by the computing-device-based computing system and based on the one or more components of the Z-score other than a sum and a mean for the pre-modified computation subset, one or more components of a Z-score other than a sum and a mean for the modified computation subset, wherein the directly iteratively deriving includes:
accessing the one or more components of the Z-score other than a sum and a mean initialized or derived for the pre-modified computation subset without accessing all data elements in the modified computation subset to allow the computing-device-based computing system to use less memory; and
removing any contribution of the removed data element from each of the accessed components and adding any contribution of the added data element to each of the accessed components without using all data elements in the modified computation subset thereby resulting in faster computation time;
accessing, by the computing-device-based computing system, a data element selected for a Z-score calculation; and
generating, by the computing-device-based computing system, a Z-score for the selected data element in the modified computation subset based on one or more of the iteratively derived components.

US Pat. No. 10,394,808

DATABASE QUERY EXECUTION TRACING AND DATA GENERATION FOR DIAGNOSING EXECUTION ISSUES

INTERNATIONAL BUSINESS MA...

1. A system comprising:a processor; and
a non-transitory computer readable storage medium connected to the processor, wherein the non-transitory computer readable storage medium has stored thereon a program for controlling the processor, and wherein the processor is operative with the program to execute the program for:
receiving trace data captured for a first execution of a first query on first input data, wherein the trace data associates clauses of the first query with respective evaluation states that arise during the first execution of the first query;
generating second input data from the trace data without accessing the first input data, wherein the first input data include data values and generating the second input data from the trace data without accessing the first input data comprises:
generating values for the second input data corresponding to respective ones of the first input data values, where the values generated for the second input data are generated from the trace data and not from the first input data, and wherein each second input data value has a value such that in execution of the second query each second input data value produces the same evaluation state as the evaluation state captured in the trace data for the corresponding first input data value but is otherwise independent of the corresponding first input data value, so that the first input data is kept private in both the execution of the second query and the generating of the second input data values, since each second input data value is generated from the trace data instead of from the first input data;andperforming an execution of a second query on the second input data, wherein execution trouble occurred on the first execution of the first query on first input data, and wherein the second input data is configured, in the generating of the second input data from the trace data without accessing the first input data, such that performing the execution of the second query on the second input data reproduces at least selected evaluation states that tend to be associated with the execution trouble from the first execution of the first query on the first input data, so that executing the second query on the second input data tends to reproduce the execution trouble from the first execution of the first query on the first input data without accessing the first input data.

US Pat. No. 10,394,806

DATABASE-INDEPENDENT MECHANISM FOR RETRIEVING RELATIONAL DATA AS XML

Progress Software Corpora...

1. A computer-implemented method comprising:receiving, using one or more processors, an XQuery query from an application;
dividing the XQuery query into a first XQuery expression and a second XQuery expression;
determining, by the one or more processors, that the first XQuery expression queries a XML data source and the second XQuery expression queries a relational data source;
executing the first XQuery expression on the XML data source, and receiving a first XML query result for the first XQuery expression from the XML data source;
translating the second XQuery expression into a SQL expression;
executing the SQL expression on the relational data source, and receiving a SQL query result for the SQL expression from the relational data source;
mapping the SQL query result of the SQL expression into a second XML query result;
combining the first XML query result associated with the first XQuery expression and the second XML query result associated with the second XQuery expression into an XML result for the XQuery query; and
providing the XML result of the XQuery query to the application.

US Pat. No. 10,394,805

DATABASE MANAGEMENT FOR MOBILE DEVICES

SAP SE, Walldorf (DE)

1. A method to be performed on one or more data processors comprising at least part of a computer system of a database management system, the method comprising:receiving, from a mobile device, a request to transmit a subset of the data stored on a database associated with a the database management system, the request including an indication of a user associated with the mobile device;
identifying, based on the indication of the user, a subset of the data contained within the database to store locally on the mobile device, the identifying including identifying a calculation scenario associated with the user, the calculation scenario usable by multiple different queries and which uses an index formed from logical metamodels that join tables to form the index;
performing, by the database management system and according to the calculation scenario, a set of queries on the database to generate the subset of the data stored on the database, the set of queries based on the indication of the user;
transmitting the subset of the data stored on the database to the mobile device for local storage on the mobile device to support database operations performed by the mobile device, the mobile device including a mobile database to store the subset of data, wherein the database operations performed by the mobile device include querying the mobile database storing the subset of data;
monitoring changes to the data, stored on the database, that corresponds with data stored locally on the mobile device; and
updating the mobile device with the changes to the data;
wherein the calculation scenario includes a directed acyclic graph including edges representing data flows and nodes representing operations, each node including a set of inputs and outputs and an operation that transforms the inputs into the outputs, wherein the inputs and outputs are user-defined table types that are passed into a procedure or function.

US Pat. No. 10,394,804

METHOD AND SYSTEM FOR INCREASING INTERNET TRAFFIC TO A QUESTION AND ANSWER CUSTOMER SUPPORT SYSTEM

Intuit Inc., Mountain Vi...

1. A computer-implemented method for increasing Internet traffic to a question and answer customer support system, the method comprising:receiving original question data representing an original question being submitted to a question and answer customer support system by a question submitting user for potential publishing in the question and answer customer support system;
storing the original question data in memory allocated to processing information for the question and answer customer support system;
analyzing the original question data, in the memory with a processor, to determine a searchability score to be associated with the original question data, the searchability score being determined by accumulating numerical assignments applied to attributes of the original question data;
comparing, with the processor, searchability score data associated with the original question data to threshold searchability score data, the threshold searchability score data representing a threshold searchability score;
upon a determination that the searchability score is less than the threshold searchability score represented by the threshold searchability score data, analyzing the original question data, with the processor, using one or more question searchability factors, to determine suggestions for reforming the original question to increase an estimated likelihood of the one or more Internet search engines matching search criteria with the original question, the suggestions including at least a suggestion to convert the original question from one type to another, with suggestions being selected from at least converting a why question type to a how type question type, transforming a why question type to a closed ended question type, and transforming a why question type to a what question type;
based, at least in part, on the analyzing the original question data using the one or more question searchability factors, generating question reformation data representing suggestions to customer support personnel for the question and answer customer support system, for transforming the original question data into reformed question data representing a reformed question estimated to have a searchability score associated with the reformed question data;
providing the question reformation data to the customer support personnel for the question and answer customer support system;
receiving the reformed question data from the customer support personnel representing the reformed question that is reformed from the original question based, at least in part, on the question reformation data;
generating reformed question answer data, the reformed question answer data representing an answer to the reformed question data representing the reformed question; and
publishing the reformed question represented by the reformed question data, with the answer to the reformed question represented by reformed question answer data, in the question and answer customer support system, to enable the reformed question represented by the reformed question data and/or the answer to the reformed question represented by the reformed question answer data to be searched by the one or more Internet search engines and to increase a likelihood of receiving Internet traffic to the question and answer customer support system.

US Pat. No. 10,394,803

METHOD AND SYSTEM FOR SEMANTIC-BASED QUERIES USING WORD VECTOR REPRESENTATION

International Business Ma...

1. A method comprising:generating a set of token sequences for at least a portion of a database, wherein each token in a sequence represents a respective database entity of the database, wherein the set of token sequences comprises at least one of:
a token sequence obtained by following at least one foreign key and at least one IDREF reference; or
a token sequence obtained by following at least one path in a database tree, wherein the database is hierarchical;
assigning, for each token in the set of token sequences, at least one corresponding vector from a set of vectors of a same dimension, wherein the at least one corresponding vector encodes relationships between the database entity of a token and other database entities of other tokens of the set of token sequences; and
extracting, using a query language, information from the database based at least in part on the relationships encoded by the assigned vectors.

US Pat. No. 10,394,802

INTERACTIVE LOCATION QUERIES FOR RAW MACHINE DATA

Splunk, Inc., San Franci...

1. A computer-implemented method for providing a user interface for an interactive data query, comprising:receiving a query input at a user interface, wherein the query input defines a field search query for searching raw machine data;
receiving a map input at an interactive map portion of the user interface, wherein the interactive map portion displays a map region;
displaying, at the user interface, a user-defined overlay of the map region based on the map input, wherein the user-defined overlay depicts one or more ad-hoc boundary regions;
generating location search information for searching raw machine data based on the one or more ad-hoc boundary regions;
generating a combined query based on the field search query and the location search information;
transmitting the combined query to a data query system;
receiving a set of results from the data query system, wherein the received results are responsive to both the field search query and the location search information, and wherein individual results within the set of results identify a value from the raw machine data and a timestamp corresponding to the value;
displaying a visualization of the set of results as an ordering of the set of results over a time range, wherein the ordering is determined based at least in part on the timestamps identified within the results, and wherein a portion of the visualization is selectable to indicate a subrange of the time range;
obtaining a selection of the portion of the visualization; and
displaying a subset, of the set of results, that identify a timestamp within the subrange.

US Pat. No. 10,394,801

AUTOMATED DATA ANALYSIS USING COMBINED QUERIES

Oracle International Corp...

1. A method comprising:receiving, by a computer system, information identifying a first data source and a second data source;
executing, by the computer system, a first query to retrieve a set of metadata attributes for the first data source;
executing, by the computer system, a second query to retrieve a set of metadata attributes for the second data source;
receiving, by the computer system, (i) user input indicative of selection of one or more metadata attributes from the set of metadata attributes for the first data source, and (ii) user input indicative of selection of one or more metadata attributes from the set of metadata attributes for the second data source;
generating, by the computer system, a first single source query based upon the one or more metadata attributes selected from the set of metadata attributes for the first data source, wherein the first single source query is for extracting first data from the first data source;
generating, by the computer system, a second single source query based upon the one or more metadata attributes selected from the set of metadata attributes for the second data source, wherein the second single source query is for extracting second data from the second data source;
generating, by the computer system, a base query based upon the first single source query for extracting the first data from the first data source and the second single source query for extracting the second data from the second data source, wherein the base query is able to extract the first data from the first data source and the second data from the second data source, and wherein the generating the base query comprises normalizing the one or more metadata attributes selected for the first data source with the one or more metadata attributes selected for the second data source;
obtaining, by the computer system, a result set by executing the base query, the result set comprising the first data and the second data;
determining, by the computer system, a set of metadata attributes for the result set;
outputting, by the computer system, the set of metadata attributes for the result set;
receiving, by the computer system, first analysis information identifying a first analysis to be performed based upon the result set, the first analysis information indicating selection of one or more metadata attributes from the set of metadata attributes for the result set;
generating, by the computer system, a first modified query based upon the base query and the first analysis information;
obtaining, by the computer system, a first analysis result set by executing the first modified query; and
outputting, by the computer system, the first analysis result set.

US Pat. No. 10,394,800

OPTIMIZING CONTINUOUS QUERY OPERATIONS IN AN IN MEMORY DATA GRID (IMDG)

International Business Ma...

1. A method for optimized continuous query processing in an in memory data grid (IMDG), the method comprising:receiving a request to add an object to an IMDG;
evaluating a continuous query upon the object in order to produce a result;
adding an attribute to the object referencing the continuous query and assigning a value to the attribute of the result;
inserting the object with the attribute into the IMDG; and,
returning the value of the attribute in lieu of repeating an evaluation of the continuous query in response to receiving a request to repeat an evaluation of the continuous query in respect to the object.

US Pat. No. 10,394,798

METHOD OF ENSURING TRANSACTIONAL INTEGRITY OF A SYSTEM THAT INCLUDES A FIRST SUBSYSTEM AND A SECOND SUBSYSTEM

Gravic, Inc., Malvern, P...

1. A method of ensuring transactional integrity of a system that includes a first subsystem and a second subsystem, each subsystem including (i) a hardware processor, (ii) an application executing in the hardware processor, (iii) an indicia engine, and (iv) an instance of a database used by the application, each subsystem executing transactions, each transaction including a BEGIN step, and one or more data manipulation language (DML) or data definition language (DDL) operations, the system performing the method comprising:(a) receiving at the first subsystem a request to process a transaction;
(b) the first subsystem sending to the second subsystem the request to process a transaction;
(c) processing in the application executing in the hardware processor at each subsystem the identical request in the instance of the subsystem's database;
(d) the indicia engine at each subsystem computing indicia of the outcome of the processing of the identical request in step (b), wherein the indicia is dependent upon at least a subset of the DML or DDL operations;
(e) the indicia engine at the second subsystem sending its computed indicia to the first subsystem; and
(f) the indicia engine at the first subsystem:
(i) comparing its computed indicia with the indicia received from the second subsystem, and
(ii) sending a transaction abort directive to the second subsystem when the comparison indicates that the computed indicia of the second subsystem does not match the computed indicia of the first subsystem, thereby indicating a lack of transactional integrity in one or both of the first and second subsystems.

US Pat. No. 10,394,797

METHOD AND COMPUTING APPARATUS FOR MANAGING MAIN MEMORY DATABASE

TmaxData Co., Ltd., Gyeo...

1. A management method of a main memory database which is performed in a computing apparatus including one or more processors and a main memory, which stores commands executable in the processors, the method comprising:generating in the main memory a first log which is a target of the log compaction including collected change information of each change when the change occurs, which includes at least one of a data insertion, an update, and a deletion of data recorded in the main memory by one of the processors;
recording the first log which is a target of the log compaction in the main memory in a permanent storing device to generate a first log file by one of the processors; and
performing log compaction which leaves only effective change information among change information of the data included in the log on the first log to generate a second log including only effective change information among change information on individual data in order to reduce the size of the log by one of the processors,
wherein the data is configured by one or more versions which are connected by a link and generate a version chain, based on a modified time sequence,
wherein the version chain is connected with a link which connects a next version and a previous version based on a version identification information, in order to read a data corresponding to a transaction in accordance with the link of the version chain of the data when reading a data recorded in the database,
wherein the version includes a header and a data field,
wherein the header includes at least one of a flag which indicates a usage state of the version or whether the version is deleted, the version identification information which includes information for identifying a version, a time stamp which includes information about time of a transaction related with the version, and data identification information which includes identification information indicating whether a value recorded in the data field is located in a specific column and row of the data table of the database,
wherein the version identification information includes information of an address value on a main memory of a next version of the data, in order to link with the next version,
wherein the data field includes a data value.

US Pat. No. 10,394,792

DATA STORAGE IN A GRAPH PROCESSING SYSTEM

Google LLC, Mountain Vie...

1. A computer-implemented method comprising:receiving user data and graph data at a distributed computing system, the graph data describing a graph representing a task to be performed by one or more computing devices in the distributed computing system, the graph including a plurality of vertices connected by one or more edges, each of the vertices associated with one or more data fields that are included in a vertex names vector;
performing, by the one or more computing devices, the task using the user data and the graph data, wherein the performing comprises:
identifying a request to change an existing value of a data field associated with a particular vertex in the graph data, the request including a new value for the data field;
determining that a length of the new value for the data field is shorter than a length of the existing value of the data field; and
in response to determining that the length of the new value for the data field is shorter than the length of the existing value of the data field, replacing the existing value by (i) replacing a first portion of the data field that is associated with the particular vertex with exception information that indicates the length of the new value that is shorter than the length of the existing value, (ii) replacing a second portion of the data field that is associated with the particular vertex with the new value, and (iii) updating a flag in an exception flag vector to indicate an inclusion of the exception information in the data field, the flag being located at a position in the exception flag vector that indicates a position of the data field in the vertex names vector; and
providing, by the one or more computing devices, an output for the task, wherein the output is determined using, in part, the data field that includes the exception information.

US Pat. No. 10,394,790

TABLE ORGANIZATION USING ONE OR MORE QUERIES

International Business Ma...

1. A program product, comprising:a computer readable storage medium; and
program code stored on the computer readable storage medium and configured upon execution to reorganize a database table residing on a computer system according to a set of queries, comprising the steps of:
constructing a bitmap entry for each row entry within the database table, each bitmap entry having n bit positions, each of the n bit positions corresponding to a referencing state of a different one of the set of queries;
computing a single numerical value for each bitmap entry as a function of individual bit values for the n bit positions; and
sorting the row entries within the database table based upon the numerical values of the bitmap entries.

US Pat. No. 10,394,789

TECHNIQUES AND SYSTEMS FOR SCALABLE REQUEST HANDLING IN DATA PROCESSING SYSTEMS

Amazon Technologies, Inc....

1. A computer-implemented method, comprising:in response to receiving a plurality of data storage requests for data to be stored in a plurality of volumes of durable storage of a data storage system, processing the data storage requests by at least:
obtaining events associated with each of the plurality of data storage requests;
assigning the events to one or more specified database tables, wherein the one or more database tables are rotated for assignment of the events, the database tables being configured so as to include an entry for each of the assigned events in both:
a primary index table that utilizes a pseudorandomly generated primary key for each of the assigned events; and
a secondary index table that uses information in the primary index table as its primary key, the information being different from the pseudorandomly generated primary key;
storing, asynchronous from receiving the plurality of the data storage requests, the data into the plurality of volumes in accordance with the events assigned to the one or more database tables, the data stored by at least:
applying a redundancy code to the data associated with the data storage requests to generate a set of shards representative of the data;
storing the shards on the plurality of volumes; and
updating entries corresponding to the events assigned to the one or more database tables; and
responding, synchronous from receiving the plurality of the data storage requests, to status requests regarding pendency of the events associated with each of the plurality of data storage requests by at least using the primary key of the secondary index table.

US Pat. No. 10,394,786

SERIALIZATION SCHEME FOR STORING DATA AND LIGHTWEIGHT INDICES ON DEVICES WITH APPEND-ONLY BANDS

Futurewei Technologies, I...

1. A method implemented by a network element (NE) implemented as a storage device, comprising:receiving, by a receiver of the NE, a plurality of data records;
receiving, by the receiver, a plurality of attributes describing aspects of the data records;
storing, by a memory of the NE, the data records in data segments in a data band of the memory;
determining, by a processor of the NE, a descriptor interval for each of the data segments, the descriptor interval comprising a minimum descriptor for each data segment and a maximum descriptor for each data segment, the minimum descriptor being a minimum value for an attribute, and the maximum descriptor being a maximum value for the attribute;
composing, by the processor, a lightweight index for the data segments, the lightweight index comprising the minimum descriptor for each data segment and the maximum descriptor for each data segment;
appending, by the processor, the lightweight index to the data segments in the data band; and
transmit, by a transmitter coupled to the processor, the lightweight index to an index server to respond to a query for one of the data records.

US Pat. No. 10,394,785

METHOD AND/OR SYSTEM FOR TRANSFORMING BETWEEN TREES AND ARRAYS

Robert T. and Virginia T....

1. A method, comprising:accessing instructions from one or more physical memory devices for execution by one or more processors; executing instructions accessed from the one or more physical memory devices by the one or more processors;
storing, in at least one of the physical memory devices, signal values resulting from having executed the instructions on the one or more processors;
wherein the accessed instructions to transform between a tree and an array of numerical signal values; and wherein executing the transformation instructions further comprising:
transforming the tree to the array of numerical signal values, based at least in part on a unique mapping between tree structures and numerical signal values, the array of numerical signal values comprising one or more rows and columns of numerical signal values and an associated index for the one or more rows and columns of numerical signal values;
performing manipulation of the tree, wherein the performing manipulation of the tree comprises processing the array of numerical signal values to yield an updated array of numerical signal values, the updated array of numerical signal values utilizing less storage space in the one or more physical memory devices than the array of numerical signal values;
storing the updated array of numerical signal values in the one or more physical memory devices; and
generating a resulting tree, wherein the generating the resulting tree comprises transforming the updated array of numerical signal values to an updated tree, based at least in part on the unique mapping between the tree structures and numerical signal values.

US Pat. No. 10,394,784

TECHNOLOGIES FOR MANAGEMENT OF LOOKUP TABLES

Intel Corporation, Santa...

1. An apparatus to be implemented as a node in a cluster of a plurality of nodes, the apparatus comprising:a memory to store two versions of a global lookup table (GT) including an online version of the GT and an offline version of the GT, wherein the GT maps keys to values of key-value pairs and is replicated across each node in the cluster, and the node is permitted to modify a first portion of the offline version of the GT at the node; and
a GT manager to determine whether a new value is to be stored in a key-value pair in the first portion, update the key-value pair in the offline version of the GT of the node with the new value when the new value is to be stored in the key-value pair in the first portion, update the online version of the GT of the node based on the offline version of the GT of the node, and update the online version of the GT of the node based on an obtained key-value pair when the new value is to be stored in a second portion of the GT that the node is not permitted to modify, wherein the obtained key-value pair indicates the key and the new value.

US Pat. No. 10,394,783

PARALLEL BUILD OF NON-PARTITIONED JOIN HASH TABLES AND NON-ENFORCED N:1 JOIN HASH TABLES

International Business Ma...

1. A method for creating a compact hash table comprising:a thread executing using a processor for scanning a subset of keys and values, and for each key, performing a hash operation and inserting hashed keys into a bitmap;
determining cumulative population counts of keys and values within the bitmap;
repeating scanning of the subset of the keys and values;
inserting the keys and values into a compacted array using the cumulative population counts; and
creating a compact hash table comprising the bitmap and the compacted array.

US Pat. No. 10,394,782

CHORD DISTRIBUTED HASH TABLE-BASED MAP-REDUCE SYSTEM AND METHOD

UNIST (ULSAN NATIONAL INS...

1. A chord distributed hash table based MapReduce system comprising:multiple servers including file systems and in-memory caches storing data based on a chord distributed hash table; and
a job scheduler managing the data stored in the file systems and the in-memory caches in a double-layered ring structure, the job scheduler, when receiving a data access request for a specific file from an outside, allocating MapReduce tasks to servers that store the file for which the data access request has been received among the multiple servers, and outputting a result value obtained by performing the MapReduce tasks in response to the data access request,
wherein the in-memory cache stores a hash key corresponding to data by using the chord distributed hash table, and after assigning a preset hash key range to the in-memory cache, stores a hash key included in the hash key range and data corresponding to the hash key.

US Pat. No. 10,394,781

SYNCHRONIZATION OF OFFLINE DATA

SAP SE, Walldorf (DE)

1. A method for synchronizing data records in a backend database coupled to a backend server and data records in a client database coupled to a client computing device, each database including a respective data record under a same data record name, the method comprising:generating, at the backend server and during each of a plurality of periodic hash-computation time periods, a hash value of each of a plurality of backend data records, wherein the backend server is configured to store data for the plurality of the backend data records without storing an associated time stamp indicative of a time the data is stored, wherein the start of each periodic hash-computation time period is scheduled to minimize disruptions due to computational loading of the backend server;
storing, at the backend server, a cached administrative record for each of the plurality of backend data records, each cached administrative record including the generated hash value and a hash time stamp of the time at which the hash value was generated;
receiving, at the backend server and from the client computing device, a client data record name and a client data record hash value, the client data record hash value being generated by the client computing device based on a client data record associated with the client data record name;
initiating, at the backend server and in response to receiving the client data record name and the client data record hash value from the client computing device, synchronization, including:
retrieving, at the backend server, a cached administrative record for a backend data record with a same name as the received client data record name;
determining, at the backend server and based on the hash time stamp in the retrieved cached administrative record, whether the hash value in the retrieved cached administrative record was generated after the start of the current hash-computation time period;
when the hash value in the retrieved cached administrative record is determined to be generated after the start of the current hash-computation time period, determining whether the received client data record hash value is the same as the hash value in the retrieved cached administrative record, and when the hash values are the same, determining that there is no need to send the backend data record associated with the retrieved cached administrative record to the client computing device.

US Pat. No. 10,394,780

DETECTING INTERESTING DECISION RULES IN TREE ENSEMBLES

International Business Ma...

1. A method, in a data processing system, for detecting interesting decision rules from a set of decision rules in a tree ensemble, the method comprising:traversing each tree in the tree ensemble in order to assign each individual data record from a set of data records in an evaluation data set to an identified leaf node in a set of leaf nodes in each tree;
determining predicted values defined by the tree ensemble based on predictions provided by each leaf node to which each individual data record is assigned;
determining interesting sub-indices for decision rules from the set of decision rules corresponding to the leaf nodes in the tree ensemble, wherein determining the interesting sub-indices for decision rules corresponding to the leaf nodes in the tree ensemble for categorical targets comprises:
identifying a proportion of data records P(R(t)) determined by the leaf node t where the decision rule is accurate, R(t) being the event that the decision rule based on the node t is accurate;
identifying a proportion of data records P(E(t)) determined by the leaf node t where the tree ensemble model is accurate, E(t) being an event that the ensemble prediction is accurate based on a data record determined by node t;
determining a proportion P(?(t)) that the ensemble prediction is inaccurate based on a data record determined by node t by defining P(?(t))=1?P(E(t));
identifying a proportion of data records P(?(t)R(t)) determined by the node t that are predicted accurately b both the ensemble model and the decision rule;
identifying a proportion of data records P(?(t)R(t)) determined by the node t that are predicted inaccurately by both the ensemble model and the decision rule;
determining a first sub-index of interestingness I1t based on prediction agreement between the ensemble model and the decision rule as I1t=P(E(t)R(t))+P(?(t)R(t));
determining a second sub-index of interestingness I2t on the decision rule accuracy as I2t=P(R(t)); and
determining a third sub-index of interestingness I3t on the ensemble model accuracy as I3t=P(E(t));
for each decision rule corresponding to the leaf nodes in the tree ensemble, combining the sub-indices into interestingness index It;
ranking the decision rules corresponding to the leaf nodes in the tree ensemble according to the associated value of the interestingness index It; and
reporting a subset of the decision rules corresponding to the leaf nodes in the tree ensemble in order to provide a notification of the interesting decision rules in the tree ensemble.

US Pat. No. 10,394,779

DETECTING INTERESTING DECISION RULES IN TREE ENSEMBLES

International Business Ma...

1. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:traverse each tree in a tree ensemble in order to assign each individual data record from a set of data records in an evaluation data set to an identified leaf node in a set of leaf nodes in each tree;
determine predicted values defined by the tree ensemble based on predictions provided by each leaf node to which each individual data record is assigned;
determine interesting sub-indices for decision rules from a set of decision rules corresponding to the leaf nodes in the tree ensemble, wherein the computer readable program to determine the interesting sub-indices for decision rules corresponding to the leaf nodes in the tree ensemble for categorical targets further causes the computing device to:
identify a proportion of data records P(R(t)) determined by the leaf node t where the decision rule is accurate, R(t) being the event that the decision rule based on the node t is accurate;
identify a proportion of data records P(E(t) determined by the leaf node t where the tree ensemble model is accurate, E(t) being an event that the ensemble prediction is accurate based on a data record determined by node t;
determine a proportion P(?(t)) that the ensemble prediction is inaccurate based on a data record determined by node t by defining P(?(t))=1?P(E(t));
identify a proportion of data records P(E(t)R(t))determined by the node t that are predicted accurately by both the ensemble model and the decision rule;
identify a proportion of data records P(?(t)(R(t)) determined by the node t that are predicted inaccurately by both the ensemble model and the decision rule;
determine a first sub-index of interestingness I1t based on prediction agreement between the ensemble model and the decision rule as I1t=P(E(t)R(t))+P(?(t)R(t));
determine a second sub-index of interestingness I2t on the decision rule accuracy as I2t=P(R(t));and
determine a third sub-index of interestingness I3t he ensemble model accuracy as I3t=P(E(t));
for each decision rule corresponding to the leaf nodes in the tree ensemble, combine the sub-indices into interestingness index It;
rank the decision rules corresponding to the leaf nodes in the tree ensemble according to the associated value of the interestingness index It; and
report a subset of the decision rules corresponding to the leaf nodes in the tree ensemble in order to provide a notification of the interesting decision rules in the tree ensemble.

US Pat. No. 10,394,777

FAST ORTHOGONAL PROJECTION

Google LLC, Mountain Vie...

1. A computer-implemented method comprising:obtaining a plurality of content items;
extracting a plurality of features from each of the plurality of content items;
generating a feature vector for each of the extracted features in order to create a search space;
generating a series of element matrices based upon the generated feature vectors, wherein each element matrix of the series of element matrices is associated with one or more relationships;
enhancing the search space at least in part by transforming the series of element matrices into a structured matrix such that the transformation preserves the one or more relationships associated with each element matrix of the series of element matrices;
receiving a search object;
searching the enhanced search space based on the received search object; and
providing one or more links to one or more content items that are responsive to the search object.

US Pat. No. 10,394,775

ORDER CONSTRAINT FOR TRANSACTION PROCESSING WITH SNAPSHOT ISOLATION ON NON-TRANSACTIONAL NOSQL SERVERS

INTERNATIONAL BUSINESS MA...

1. A method of managing a commitment time comprising:receiving, with at least a transaction management server in an NoSQL environment, communications related to a first transaction from at least a first client, and communications related to a second transaction from at least a second client;
determining, with the transaction management server, when the first client reads a value in the first transaction that is being updated by the second client in the second transaction whether the second transaction has been committed; and
applying, with the transaction management server, a constraint provided by a commit timestamp to the second client which causes the second client to commit after the start time of the first transaction in response to the first client reading the value before the second transaction has been committed.

US Pat. No. 10,394,774

DETERMINING WHEN A CHANGE SET WAS DELIVERED TO A WORKSPACE OR STREAM AND BY WHOM

INTERNATIONAL BUSINESS MA...

1. A computer-implemented method, comprising:storing, using a processor, to a functional data structure a plurality of events associated with a workspace or stream, each of the plurality of events comprising at least an indication of when an operation in the workspace or stream occurred and who performed the operation;
receiving a user input performing an operation to move a pointer of the workspace or stream from a first node of a change set history tree to a second node of the change set history tree;
identifying a change set that is of interest, wherein the change set that is of interest is incorporated into the workspace or stream responsive to the user input performing the operation to move the pointer of the workspace or stream from the first node of the change set history tree to the second node of the change set history tree;
identifying as a subject event a particular event stored in the functional data structure;
identifying as a previous event a particular event stored in the functional data structure that precedes the subject event;
identifying a set of nodes of a change set history tree corresponding to the subject event which are not present in a set of nodes of a change set history tree corresponding to the previous event, each node representing a change set delivered to the workspace or stream, and determining whether the set of nodes corresponding to the subject event, which are not present in the set of nodes of the change set history tree corresponding to the previous event, includes a node representing the change set that is of interest;
responsive to determining that the change set of interest is not included in the set of nodes corresponding to the subject event, which are not present in the set of nodes of a change set history tree corresponding to the previous event, until a set of nodes including the change set of interest is identified, recursively:
re-identifying as the subject event the event currently identified as the previous event and identifying as the previous event a particular event stored in the functional data structure that precedes the re-identified subject event; and
identifying a corresponding set of nodes of the change set history tree corresponding to the subject event which are not present in the set of nodes of a change set history tree corresponding to the previous event, and determining whether the set of nodes corresponding to the subject event, which are not present in a set of nodes of a change set history tree corresponding to the previous event, includes a node representing the change set that is of interest; and
responsive to determining that the corresponding set of nodes includes the node representing the change set that is of interest, identifying the subject event as an event that added the change set of interest to the workspace or stream and retrieving from the subject event the indication of when the operation represented by the event occurred and who performed the operation; and
outputting the indication of when the operation represented by the event occurred and who performed the operation.

US Pat. No. 10,394,772

DATABASE CAPACITY ESTIMATION FOR DATABASE SIZING

International Business Ma...

1. A method for sizing databases, the method comprising:receiving, by one or more processors, an input value of each characteristic of multiple characteristics pertaining to utilization of multiple databases in a computer system;
identifying, by the one or more processors, multiple patterns of historical capacity usage by the multiple databases, wherein the multiple patterns are statistically significant for the multiple characteristics due to the multiple databases including the input values, and wherein the capacity usage is memory usage or central processing unit (CPU) usage;
computing, for each pattern, by the one or more processors, a weighted value of capacity, usage (WCU) according to WCU=ACP*FC*PC, wherein ACP=an average value of historical capacity points for each pattern, wherein FC=fraction of the characteristics associated with each pattern, and wherein PC=a fraction of the multiple databases used for each pattern;
computing, by the one or more processors, a total value of capacity usage as a sum of the weighted values of capacity usage;
sizing, by the one or more processors, one or more current databases via utilization of the computed total value of capacity usage; and
creating, by the one or more processors, a virtual machine or a new server of the computer system, wherein the virtual machine or new server comprises the sized one or more current databases.

US Pat. No. 10,394,771

USE OF SEARCH TEMPLATES TO IDENTIFY SLOW INFORMATION SERVER SEARCH PATTERNS

INTERNATIONAL BUSINESS MA...

1. A computer-implemented method within an information server for identifying efficiency of search templates used to search an information source, comprising:receiving a first search request generated using a first search template;
receiving a second search request different from the first search request and generated using a second search template;
performing, using a search engine and based upon the received first search request, a first search on the information source that produces first search results;
performing, using the search engine and based upon the received second search request, a second search on the information source that produces second search results different from the first search results;
updating, based upon the first search results a result associated with the first search, a first statistical record associated with the first search template;
updating, based upon the second search results a result associated with the second search, a second statistical record associated with the second search template; and
ranking efficiency of the first and second search templates based upon the first and second statistical records, wherein
the first statistical record includes results from a plurality of searches performed using search requests generated using with the first search template, and
the second statistical record includes results from a plurality of searches performed using search requests generated using with the second search template, wherein
the first search request and the second search request are separately received by the information server,
the first statistical record includes a first search template identifier that identifies the first search template,
the second statistical record includes a second search identifier that identifies the second search template.

US Pat. No. 10,394,770

METHODS AND SYSTEMS FOR IMPLEMENTING A DATA RECONCILIATION FRAMEWORK

General Electric Company,...

1. A computer system implementing a data reconciliation framework, the computer system configured to:receive core data, the core data comprising a plurality of data records associated with at least two assets;
receive a system model, the system model comprising context data indicating at least one characteristic of the at least two assets;
execute a configuration operation of a data validation process based on the system model, wherein the configuration operation comprises selecting at least one heuristic included in the system model, the selection based on the at least one characteristic;
execute the data validation process to identify at least one missing, inconsistent, or incomplete record among the plurality of data records;
determine at least one data reconciliation technique from a plurality of data reconciliation techniques based on the system model; and
generate a consistent data set by applying the at least one data reconciliation technique to the core data to impute the at least one missing data record or remove the at least one inconsistent or the at least one incomplete record.