US Pat. No. 11,113,345

METHOD AND SYSTEM FOR PROVIDING CONTEXTUAL ELECTRONIC CONTENT

BIGTINCAN HOLDINGS LIMITE...


1. A method to be implemented by a system for providing at least one of a document or file to a user device of the system, via a network, based on at least one contextual parameter, the method comprising:retrieving, in response to a change in value of at least one contextual parameter, at least one document or file from at least one source based on the at least one contextual parameter, the changed contextual parameter relating to a scheduled event which will result in the user device being disconnected from the network;
applying weights to the retrieved document or file and the at least one contextual parameter, based on a history of the document or file;
recommending the retrieved document or file to the user based on the weighted document or file and the weighted at least one contextual parameter;
providing the recommended document or file to the user device of the system in a first form, the first form being dependent on at least one device parameter of the user device;
and providing content related to the recommended document or file to another user device of the system in a second form, the second form being dependent on at least one device parameter of said another user device,
wherein the user device and the another user device are different types of user devices, and the content related to the recommended document or file is a different type of content that relates to the scheduled event; and
wherein the at east one contextual parameter s independent of other user devices of the system.

US Pat. No. 11,113,344

AUTOMATED DISCOVERY OF NETWORK CAMERA IN HETEROGENEOUS WEB PAGES

Purdue Research Foundatio...


14. A method for indexing network camera data across heterogeneous web page structures, comprising:receiving a list of predetermined file formats associated with image or video data;
generating a list of IP addresses associated with potential network cameras;
transmitting a network request to each of the IP addresses in the list, thereby invoking a response,
waiting for a response from each of the IP addresses, wherein based on a response or lack of response from each IP address to the network request determine if an IP address is i) a network camera thereby adding the corresponding IP address to a list of network cameras, ii) a website thereby adding the corresponding IP address to a list of websites to be further investigated, or iii) an IP address void of network camera information thereby skipping the IP address; and
crawling the IP addresses that have been determined to be websites using a web crawler identifying IP addresses of network cameras and the IP address and resource path associated with network camera data and adding the identified IP addresses and resource paths to the list of network cameras.

US Pat. No. 11,113,343

SYSTEMS AND METHODS FOR ENABLING A USER TO OPERATE ON DISPLAYED WEB CONTENT VIA A WEB BROWSER PLUG-IN

NEWSPLUG, INC., New York...


1. A method comprising:transmitting, by a server computer, a plug-in module to a web browser of a client computer, the web browser displaying web content in a main window,wherein the plug-in module, when activated, causes the web browser to display a user interface to a user of the client computer, wherein the user interface:is separate from the main window of the web browser,
automatically displays at least a portion of the web content according to user settings that identify what the displaying at least a portion of the web content includes,
is configured to enable the user to operate on the displayed at least a portion of the web content, and
is configured to enable the user to adjust the portion of the web content displayed in the user interface to generate user content, wherein adjusting the portion of the web content comprises removing content from the portion of web content or modifying the portion of web content,


transmitting, by the server computer, the plug-in module to a second client computer;
receiving, at the server computer, a URL from the plug-in module at the second client computer;
identifying, by the server computer, the web content in an index based on the URL received from the second client computer; and
transmitting, by the server computer, an advertisement to the second client computer for display.

US Pat. No. 11,113,342

TECHNIQUES FOR COMPILING AND PRESENTING QUERY RESULTS

SPLUNK INC., San Francis...


1. A system comprising:a memory including instructions; and
a processor that is coupled to the memory and, when executing the instructions, is configured to perform the steps of:identifying one or more anomalies in monitored data and associated with a natural language search query based on the monitored data satisfying at least one threshold, wherein the at least one threshold is determined based on one or more patterns associated with a plurality of related attributes in the monitored data; and
presenting, along with one or more results to the natural language search query, the one or more anomalies and at least one action or recommendation associated with the one or more anomalies.


US Pat. No. 11,113,340

DATA GENERATION AND CERTIFICATION

JPMORGAN CHASE BANK, N.A....


1. A method, comprising:displaying a user interface on a display of an electronic device, the user interface configured to receive a plurality of inputs;
receiving, via the user interface, a first input of the plurality of inputs that relates to at least one data attribute and at least one corresponding data attribute description, wherein the at least one data attribute includes information that specifies a type of data, a data identifier, a field length, a range definition, and a formatting specification;
receiving, via the user interface, a second input of the plurality of inputs that relates to at least one data quality rule, wherein the at least one data quality rule includes a first rule to identify a source of the data, a second rule to identify a time that the data was originally generated, and a third rule to identify an update interval for the data;
using the received first input and the received second input to generate a set of metadata;
using the at least one data quality rule to determine a plurality of certification metrics, wherein each of the plurality of certification metrics measures a degree of data quality with respect to the at least one data quality rule;
filtering data in a data warehouse with at least one subset of the generated set of metadata;
generating new data from the filtered data, wherein the new data is compatible with the at least one data quality rule;
determining a quality score for at least one subset of the new data by applying the plurality of certification metrics to the at least one subset of the new data;
determining a composite quality score for the at least one subset of the new data by combining each of the corresponding plurality of certification metrics;
discarding the at least one subpart of the new data when the corresponding composite quality score is below a certification metric threshold;
updating the generated set of metadata based on the undiscarded new data;
augmenting the updated set of metadata with at least one additional data attribute from the new data; and
persisting the augmented set of metadata in a networked repository.

US Pat. No. 11,113,339

SYSTEM AND METHOD FOR FEDERATED CONTENT MANAGEMENT USING A FEDERATED LIBRARY AND FEDERATED METADATA PROPAGATION

ORACLE INTERNATIONAL CORP...


1. A system for enabling federated content management, the system comprising:a plurality of content servers, each including a processor and configured to store content items at a respective content database of a plurality of content databases;
a single federated library that stores content items received from the plurality of content servers, as federated content items that are accessible to each content server of the plurality of content servers;
a federated database associated with the federated library and configured to receive and store metadata associated with the federated content items; and
a plurality of federative agents, each federative agent operating on a content server of the plurality of contents servers;
wherein each federative agent is configured to push metadata associated with the federated content items from the content server on which said each federative agent operates to the federated database; and
wherein each of the plurality of content severs is configured to provide access to federated content items in the respective databases of each other of the plurality of content severs using the metadata associated with the federated content items stored in the single federated library.

US Pat. No. 11,113,338

CONCEPTS FOR ITERATIVE AND COLLABORATIVE GENERATION OF DATA REPORTS VIA DISTINCT COMPUTING ENTITIES

Optum Services (Ireland) ...


1. A computer-implemented method for generating a collaborative record, the method comprising:receiving a free-form primary provider input originating from a primary provider computing entity, wherein the free-form primary provider input comprises a plurality of unstructured data elements and is associated with a primary provider profile;
detecting, based at least in part on stored informational requirements data, discrete data elements within the unstructured data elements of the free-form primary provider input and one or more information deficiencies in the primary provider input, wherein each information deficiency indicates a respective query;
for each identified information deficiency of the one or more information deficiencies,identifying a supportive profile associated with the respective information deficiency, wherein the supportive profile is associated with a respective computing profile;
causing the supportive profile computing entity associated with the respective supportive profile to present an audiovisual interface, wherein the audiovisual interface includes an indication of the respective query associated with the information deficiency; and
receiving a supportive provider input originating from the supportive profile computing entity associated with the respective supportive profile; and

generating the collaborative record for the primary provider input based at least in part on the primary provider input and each received supportive provider input.

US Pat. No. 11,113,337

METHOD FOR IMPUTING MISSED DATA IN SENSOR DATA SEQUENCE WITH MISSING DATA

INDIAN INSTITUTE OF TECHN...


1. A method of imputing missing sensor data values in a sensor data sequence, the method comprising:generating the sensor data sequence over a period of time to determine behavior of a system over the period of time;
identifying an instance of time instant associated with a missing sensor data value associated with the sensor data sequence;
identifying a similar response data sequence corresponding to the sensor data sequence with the missing sensor data value, wherein the similar response data sequence is identified based on highest correlation with the sensor data sequence with the missing sensor data value;
identifying a data value at an instance of time instant associated with the similar response data sequence corresponding to the instance of time instant associated with the missing sensor data value associated with the sensor data sequence;
determining nearest neighbors of the identified data value in the similar response data sequence, by searching neighbors within a predetermined nearness threshold;
determining instances of time instants of the determined nearest neighbors in the similar response data sequence;
identifying instances of time instants in the sensor data sequence with the missing sensor data value corresponding to the instances of time instants of the determined nearest neighbors in the similar response data sequence;
determining a candidate value for imputing, based on sensor data values of the identified instances of time instants in the sensor data sequence through learning based on semantics of features of the sensor data values in the sensor data sequence;
imputing the candidate value, in the instance of time instant associated with the missing sensor data value associated with the sensor data sequence using the sensor data values of the identified instances of time instants in the sensor data sequence; and
determining the behavior of the system using the sensor data sequence with the imputed candidate value.

US Pat. No. 11,113,336

INFORMATION PROCESSING APPARATUS TO OUTPUT ANSWER INFORMATION IN RESPONSE TO INQUIRY INFORMATION

Ricoh Company, Ltd., Tok...


1. An information processing apparatus that outputs particular answer information corresponding to particular inquiry information that is input, the information processing apparatus comprising:memory circuitry storing a plurality of databases, each having at least a first field in which a word related to inquiry information is stored and a second field in which answer information is stored; and
circuitry configured to:perform morphological analysis on the particular inquiry information that is input, to divide the particular inquiry information into morphemes;
perform a first matching process by comparing the morphemes to the first field of each particular database of the plurality of databases stored in the memory circuitry, to determine whether to adopt the particular database as an extraction source from which the particular answer information is to be extracted; and
when a certain database of the plurality of databases is determined to be adopted as the extraction source based on the first matching process, perform a second matching process based on the morphemes and the first field of the certain database that is determined to be adopted as the extraction source, to output, as the particular answer information, data in the second field of the certain database corresponding to data in the first field of the certain database.


US Pat. No. 11,113,335

DIALOGUE SYSTEM AND COMPUTER PROGRAM THEREFOR

National Institute of Inf...


1. A dialogue system, comprising a processor configured to:receive an input utterance and generate, as a response utterance original sentence, a response to the input utterance;
estimate emotion of said input utterance by calculating, for each of a plurality of emotions prepared in advance, an input utterance emotion score indicating a degree of matching between the emotion represented by said input utterance and the plurality of emotions;
calculate, for said response utterance original sentence, a response utterance emotion score as an emotion score for each of said plurality of emotions; and
generate and output a response utterance by modifying the response utterance original sentence based on values of said input utterance emotion score and said response utterance emotion score, such that:when the response utterance emotion score and the input utterance emotion score indicate a similarity between an emotion of the response utterance and an emotion of the input utterance, the response utterance original sentence is modified to denote the similarity between the emotion of the response utterance and the emotion of the input utterance; and
when the response utterance emotion score and the input utterance emotion score indicate a dissimilarity between the emotion of the response utterance and the emotion of the input utterance, the response utterance original sentence is modified to denote the dissimilarity between the emotion of the response utterance and the emotion of the input utterance.


US Pat. No. 11,113,334

SYSTEMS AND METHODS FOR IDENTIFYING GROUPS RELEVANT TO STORED OBJECTIVES AND RECOMMENDING ACTIONS

Rexter Holdings LLC, Aus...


1. A Customer Relationship Management (CRM) system, comprising:a CRM server system comprising at least one server having at least one processor and memory containing software; and
a CRM database containing data describing:a plurality of user accounts associated with users of the CRM system;
a plurality of user defined objectives;
relationships between contacts and individual user accounts; and
event information;

wherein the at least one server in the CRM server system is configured by software to:
search metadata associated with contacts to identify contacts relevant to a defined objective;
generate recommendation notifications displayed to users associated with specific user accounts in the CRM database via a CRM system user interface, where the recommendation notifications specify actions the users are to take with respect to a defined objective;
a relationship management server system extension to the CRM system comprising at least one server having at least one processor and memory containing software,
where the at least one server in the relationship management server system extension is configured by software to:automatically and continuously aggregate event metadata via interfaces with at least a mail server, where event metadata is data describing events involving a user and one or more contacts;
store event information associated with specific user accounts and contacts in the CRM database based upon the event metadata aggregated via interfaces with the at least the mail server;
build and maintain a graph schema representing a graph of relationships between user accounts and contacts described by the data in the CRM database;
generate a recommendation concerning an action a user associated with a user account in the CRM database is to take with respect to the defined objective based upon analysis of event metadata, including event metadata aggregated via interfaces with at least the mail server, associated with other user accounts and contacts from the CRM database identified using the graph schema; and
provide the generated recommendation to the CRM server system.


US Pat. No. 11,113,333

AUTOMATED CONTENT TAG PROCESSING FOR MOBILE MEDIA

THE DIRECTV GROUP, INC., ...


1. A device, comprising:a processing system including a processor; and
a memory that stores executable instructions that, when executed by the processing system, facilitate performance of operations, comprising:
obtaining an indication that a portion of a media content item has been viewed on a mobile device;
generating a consumption profile based on the portion of the media content item that has been viewed on the mobile device;
identifying a length of time for the portion of the media content item that has been viewed on the mobile device;
searching a first content source for a portion of a plurality of content items related to content subject matter according to a schedule for ingestion and the length of time for the portion of the media content item that has been viewed on the mobile device;
receiving an ingested content item from the first content source over a first communication network, wherein the ingested content item includes a content lifecycle tag, and wherein the content lifecycle tag indicates a length of time associated with an availability of the ingested content item;
encoding the ingested content item according to the consumption profile of the ingested content item in response to processing the ingested content item according to the content lifecycle tag, wherein the processing includes at least one of stalemating the ingested content item, publishing the ingested content item, removing the ingested content item, archiving the ingested content item, performing a scheduled encoding of the ingested content item, skipping the scheduled encoding of the ingested content item, or tagging the ingested content item as no longer valid;
streaming the ingested content item to the mobile device over a second communication network;
detecting that congestion of a portion of the first communication network exceeds a congestion threshold;
pausing the streaming of the ingested content item to the mobile device over the second communication network;
receiving the ingested content item from a second content source over the first communication network that reduces the congestion on the portion of the first communication network; and
resuming the streaming of the ingested content item to the mobile device over the second communication network.

US Pat. No. 11,113,332

SYSTEMS METHODS AND COMPUTER STORAGE MEDIA FOR COLLECTING AND PROCESSING PROGRESSIVISTIC METADATA IN SPORTS


1. A system for collecting and processing progressivistic metadata in sports comprises:a) a video file source, wherein said video file comprising a video file layer including a recording of a sport event;
b) a video file database, configured for storing said video file therein, wherein said video file further comprising a timecode layer, configured for uniquely identifying particular frames or distinct segments in said video file layer;

said system is characterized by:c) a sub-system for collecting and processing progressivistic metadata comprising:(I) a server configured for generating a progressivistic metadata layer, wherein events encoded into said progressivistic metadata layer are respectively related to particular instances in said timecode layer;
(II) a database configurable for storing composite files, wherein said composite files further comprising said progressivistic metadata layer.


US Pat. No. 11,113,331

TRANSFERRING PLAYBACK FROM A MOBILE DEVICE TO A PLAYBACK DEVICE

Sonos, Inc., Santa Barba...


1. A network device comprising:a user interface;
a network interface;
a processor;
a non-transitory computer-readable medium; and
program instructions stored on the non-transitory computer-readable medium that are executable by the processor to cause the network device to perform functions comprising:playing back, on the network device, a remote playback queue provided by a cloud-based computing system, wherein playing back the remote playback queue comprises playing back a media item indicated by the remote playback queue;
receiving, via the network interface, an indication that a playback device is available for playback;
displaying, on the user interface, a now playing screen comprising (i) information identifying the media item, and (ii) a first graphical representation of an icon having a first visual appearance, wherein the first visual appearance of the icon provides an indication that the network device is not in a connected state with any other network device;
receiving, via the user interface, a first input selecting the first graphical representation of the icon;
in response to receiving the first input, displaying, on the user interface, a list of one or more available network devices, the list comprising the playback device;
receiving, via the user interface, a second input selecting the playback device from the list for playback of the remote playback queue; and
after receiving the second input:
a) updating the list to indicate that the playback device is selected for playback of the remote playback queue;
b) transferring playback of the remote playback queue from the network device to the playback device, wherein transferring playback of the remote playback queue comprises configuring the playback device to (i) play back the media item, (ii) communicate with the cloud-based computing system in order to retrieve at least one additional media item indicated by the remote playback queue, and (iii) play back the retrieved at least one additional media item; and
c) displaying, on the now playing screen, a second graphical representation of the icon, wherein the second graphical representation of the icon provides an indication that the network device is in a connected state with at least one network device.


US Pat. No. 11,113,330

SYSTEM FOR PROVIDING IMAGING SATELLITE OPPORTUNITY NOTIFICATIONS AND LOW RESOLUTION PREVIEW IMAGES ON A MOBILE DEVICE

ORBIT LOGIC, INC., Green...


1. A system configured to provide real-time imaging satellite opportunity notifications on a mobile device, the system comprising:a mobile device having a user interface configured to receive a user image request to capture satellite imagery of a user-defined location; and
a support server configured to receive, from the mobile device over a wireless network connection, information corresponding to the user image request,
wherein the system is configured to:
receive satellite state information corresponding to one or more satellites,
calculate, using the satellite state information, one or more time periods during which the one or more satellites will be capable of capturing satellite imagery of the user-defined location,
provide a real-time user notification corresponding to at least one of the calculated one or more time periods during which the one or more satellites will be capable of capturing satellite imagery of the user-defined location,
receive, by the mobile device, a low resolution preview image in response to the user image request, and
display, on a display of the mobile device, the low resolution preview image.

US Pat. No. 11,113,329

SYSTEMS AND METHODS FOR SELECTING DIGITAL DATA FOR ARCHIVAL

Bevara Technologies, LLC,...


1. An archive verification apparatus, comprising:one or more electronic hardware processing circuits, configured to execute:a functionality interpreter and instantiator, configured to instantiate a candidate accessor, wherein the instantiated candidate accessor is configured to receive input data and output first data derived from the input data,
a reference accessor configured to receive the input data and output second data derived from the input data,
a comparator configured to compare characteristics of the first data with characteristics of the second data, and
a results analyzer configured to:receive results from the comparator and determine whether the results are acceptable, and
generate an output signal based on the determination of acceptability.



US Pat. No. 11,113,328

INTERFACE ELEMENTS FOR DIRECTED DISPLAY OF CONTENT DATA ITEMS

Google LLC, Mountain Vie...


1. A computer-implemented method to provide user-selectable interface elements in a displayed graphical user interface, the method comprising:causing a first subset of content elements of a set of content elements to be presented in a display view of the graphical user interface, wherein the content elements in the set of content elements are in a sequence and wherein the set of content elements corresponds to a collection of content data items;
detecting first user input, wherein the first user input includes one or more commands to cause scrolling or page flipping of a plurality of content elements in the display view, wherein the first user input instructs display of at least one content element next or previous in the sequence of the set of content elements;
in response to the first user input:causing a change of the display view based on the first user input, wherein causing the change of the display view includes the scrolling or the page flipping of the plurality of content elements in the display view, wherein the change of the display view includes a second subset of the set of content elements being presented in the display view;
identifying one or more search topics based on one or more content characteristics associated with one or more content elements that are in a third subset of the set of content elements, wherein the third subset is smaller than the set of content elements; and
causing one or more topic elements to be displayed in the graphical user interface, wherein each topic element of the one or more topic elements corresponds to a respective search topic of the one or more search topics;

receiving second user input indicative of selection of a particular topic element of the one or more topic elements; and
in response to the second user input,searching the collection of content data items to identify one or more resulting content data items that have at least one content characteristic corresponding to a search topic that corresponds to the particular topic element; and
updating the display view to present at least one resulting content element that corresponds to at least one resulting content data item of the one or more resulting content data items.


US Pat. No. 11,113,327

DOCUMENT INDEXING, SEARCHING, AND RANKING WITH SEMANTIC INTELLIGENCE

OPTUM TECHNOLOGY, INC., ...


1. A computer-implemented method for performing a search query associated with a plurality of search terms based at least in part on a plurality of documents, the computer-implemented method comprising:performing, by one or more processors, pre-processing of each document of the plurality of documents, wherein (1) each document of the plurality of documents comprises a plurality of words to generate an indexed representation of each document of the plurality of documents, and (2) the pre-processing of a document of the plurality of documents comprises:identifying, by the one or more processors, one or more sentences in the document, wherein each sentence of the one or more sentences comprises one or more words from the plurality of words in the document;
generating, by the one or more processors and for each n-gram of one or more n-grams associated with the document, one or more n-gram semantic scores based at least in part on one or more semantic proximity indicators for the corresponding n-gram, wherein (1) each n-gram of the one or more n-grams associated with the document comprises a combination of one or more words from the plurality of words in the document, (2) each semantic proximity indicator of the one or more semantic proximity indicators for an n-gram indicates a degree of semantic relatedness between a corresponding word of the one or more words in the n-gram and a corresponding candidate semantic label of one or more candidate semantic labels associated with the document, (3) each n-gram semantic score of the one or more n-gram semantic scores for a document is generated based at least in part on one or more frequency scores for the n-gram, and (4) the one or more frequency scores for a first one-gram of the one or more n-grams in the document are generated by (a) applying a logarithmic transformation to an occurrence frequency for the first one-gram in the document to generate a logarithmic occurrence frequency for the first one-gram in the document, and applying a modulo transformation to the logarithmic occurrence frequency to generate the one or more frequency scores for the first one-gram in the document;
determining, by the one or more processors and based at least in part on each n-gram semantic score of the one or more n-gram semantic scores for an n-gram of the one or more n-grams, one or more semantic labels for each sentence of the one or more sentences in the document; and
generating, by the one or more processors, the indexed representation for the document of the plurality of documents based at least in part on the one or more semantic labels for each sentence of the one or more sentences in the document;

processing, by the one or more processors, the search query based at least in part on (1) the plurality of search terms, and (2) each indexed representation associated with a document of the plurality of documents, wherein the processing the search query comprises:providing, by the one or more processors, the search query to a data storage unit, wherein (1) the data storage unit executes the search query to generate one or more search results for the search query, and (2) executing the search query comprises:generating, for each document of the plurality of documents, a relevance score in relation to the search query based at least in part on (1) one or more selected semantic labels for the document, (2) the one or more frequency scores, and (3) the one or more n-gram semantic scores; and
generating the one or more search results based at least in part on the relevance scores for each document of the plurality of documents, wherein the one or more search results are ranked based at least in part on the relevance scores for each document of the plurality of documents; and


transmitting, by the one or more processors, the one or more search results to a computing device associated with the search query, wherein the one or more search results are displayed by the computing device.

US Pat. No. 11,113,326

AUTOMATIC EXTRACTION OF DOMAIN SPECIFIC TERMINOLOGY FROM A LARGE CORPUS

International Business Ma...


1. A method of extracting jargon from a document corpus stored in a database using a user interface and a processor with a review module, a separation module, a topic model module, a similarity score module, and a term extraction module, the method comprising:receiving a sub-domain input by the processor through the user interface to initiate a review by the review module of the document corpus stored in the database;
separating the document corpus with the separation module into at least one sub-corpus and a remainder corpus by the processor, the at least one sub-corpus defined by the sub-domain input, the remainder corpus defined by the document corpus less the at least one sub-corpus;
building a first topic model using the topic model module to evaluate at least one term extracted from the at least one sub-corpus and a second topic model using the topic model module to evaluate the at least one term extracted from the remainder corpus;
generating a first topic similarity score with the similarity score module for a select one of the at least one term by the first topic model based on a first meaning of the select term as used in the at least one sub-corpus and a second topic similarity score with the similarity score module for the select term by the second topic model based on a second meaning of the select term as used in the remainder corpus;
comparing the first and second topic similarity scores by the term extraction module, wherein, for the select term, as a result of a corresponding difference between the first and second topic similarity scores for the select term in the sub-corpus measured against the select term in the remainder corpus being greater than a predetermined threshold, the select term is identified as a jargon term; and
providing a list of jargon terms including the jargon term through the user interface.

US Pat. No. 11,113,325

TECHNIQUES FOR AUTOMATICALLY ANALYZING A TRANSCRIPT AND PROVIDING INTERACTIVE FEEDBACK PERTAINING TO INTERACTIONS BETWEEN A USER AND OTHER PARTIES

GetGo, Inc., Boston, MA ...


1. A computerized method of interactively communicating with a user to generate automated feedback pertaining to the user's interactions with other parties, the method comprising:obtaining a plurality of text sequences provided in a text transcription, the text transcription based on a recording of an interaction;
matching each of the plurality of text sequences against a set of predetermined rules arranged across multiple predetermined categories to yield a set of matches, each rule specifying a respective set of text relationships that must be present in a text sequence to yield a match, each category pertaining to a particular characteristic of the interaction for which the rules in that category test to determine whether the sequence indicates the characteristic to which the category pertains, each match identifying:(a) a particular text sequence of the plurality of text sequences,
(b) a particular category of the multiple predetermined categories, and
(c) a particular rule which matched the particular text sequence;

identifying confidence scores for the set of matches from a database of confidence scores, each confidence score reflecting a confidence that the particular text sequence identified by its respective match actually possesses the characteristic to which the particular category identified by that match pertains;
for each unique sequence/category pairing, selecting a match that identifies that unique sequence/category pairing having a highest identified confidence score and assigning that highest identified confidence score to that unique sequence/category pairing;
selecting a plurality of the unique sequence/category pairings for display based on their respective assigned confidence scores; and
causing text of the sequences of each of the selected unique sequence/category pairings to be interactively displayed within an interactive graphical user interface (GUI) on a display device, including receiving, from the user, a selection of a particular category of the multiple categories for display and, in response, causing sequences indicated to possess the characteristic to which the selected category pertains to be displayed within the interactive GUI on the display device;
wherein a rule of the set of predetermined rules specifies two words that must appear within a given proximity within a text sequence, the given proximity being within a range of 2 to 25 words; and
wherein causing text of the sequences of each of the selected unique sequence/category pairings to be interactively displayed includes:selecting a snippet from the text sequence of each of the selected unique sequence/category pairings by automatically selecting all words of that selected unique sequence/category pairing appearing within that text sequence between the two specified words, inclusive, including:determining that a number of words appearing between the two specified words does not exceed a threshold; and
selectively extending the snippet beyond the two specified words in response to determining that the number of words appearing between the two specified words does not exceed the threshold, including:extending the snippet to also include words of the sequence before a first of the two specified words up to a previous conjunctive word; and
extending the snippet to also include words of the sequence after a last of the two specified words up to a next conjunctive word; and


issuing instructions directing the selected snippet of the sequences of each of the selected unique sequence/category pairings to be automatically displayed to the exclusion of a remainder of each sequence.


US Pat. No. 11,113,324

CLASSIFIER SYSTEM AND METHOD

JANZZ LTD, Zurich (CH)


1. A method for classifying an unstructured data set according to a classification system to generate an enhanced, classified and structured data-set that enables efficient supplemental computer-based processing, the method comprising:for each item of unstructured data in the unstructured data set:interpreting a given item of unstructured data in the unstructured data set, wherein the given item includes at least a semantic description;
analyzing at least the semantic description included in the given item in accordance with an ontology of occupational concepts to identify a list of one or more concepts related to the given item;
expanding the list of concepts to include other concepts that have a salient relationship to the previously identified concepts in the list to generate an expanded list;
determining, from the expanded list, one or more concepts that most accurately correspond to the given item; and
recording at least one of the one or more determined concepts as an entry in a classified occupation data-set, wherein each entry in the classified data set is structured in accordance with standards prescribed by a given classification system of interest.


US Pat. No. 11,113,323

ANSWER SELECTION USING A COMPARE-AGGREGATE MODEL WITH LANGUAGE MODEL AND CONDENSED SIMILARITY INFORMATION FROM LATENT CLUSTERING

Adobe Inc., San Jose, CA...


1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:accessing a query on a target corpus, the query comprising a natural language question, the target corpus comprising candidate answers to the question;
generating similarity information representing a likelihood that the question is in each of a plurality of latent groupings of the target corpus by comparing the query with corresponding latent memory vectors representing the latent groupings;
generating condensed similarity information for top latent groupings of the latent groupings by consolidating the similarity information;
determining, using the condensed similarity information for the top latent groupings, matching scores comprising a matching score for each of the candidate answers, each matching score quantifying textual similarity between the query and one of the candidate answers; and
causing presentation of a top answer to the question, selected from the candidate answers, based on the matching scores.

US Pat. No. 11,113,322

DYNAMICALLY GENERATING STRATEGIC PLANNING DATASETS BASED ON COLLECTING, AGGREGATING, AND FILTERING DISTRIBUTED DATA COLLECTIONS

Bank of America Corporati...


1. A computing platform comprising:at least one processor;
a communication interface communicatively coupled to the at least one processor; and
memory storing computer-readable instructions that, when executed by the at least one processor, cause the computing platform to:send, to an administrator computing device, one or more commands directing the administrator computing device to display a graphical user interface configured to receive user input specifying:one or more text input fields, and
a graphical layout of the one or more text input fields;

receive, from the administrator computing device, a data object indicating the one or more text input fields and the graphical layout of the one or more text input fields;
store, using a first plurality of key value pairs, template layout information corresponding to the one or more text input fields and the graphical layout of the one or more text input fields;
identify a plurality of user accounts configured to receive an input request for the one or more text input fields;
generate, based on the template layout information, a data entry interface, wherein the data entry interface includes the one or more text input fields and is formatted based on the graphical layout of the one or more text input fields;
send, to a plurality of enterprise user devices linked to the plurality of user accounts, the data entry interface and a notification requesting user input at the one or more text input fields, wherein sending the data entry interface causes each of the plurality of enterprise user devices to cause display of the data entry interface;
receive, from each of the plurality of enterprise user devices, data entry information corresponding to responses in the one or more text input fields;
store the data entry information using a second plurality of key value pairs;
in response to receiving a request for output of an aggregate data collection based on the data entry information from one of the plurality of enterprise user devices, generate, using the second plurality of key value pairs and based on the data entry information, aggregate data collection information;
identify, based on the request to output the aggregate data collection, a first user of the one of the plurality of enterprise user devices as a market contributor;
send, to the one of the plurality of enterprise user devices, the aggregate data collection information and one or more commands directing the one of the plurality of enterprise user devices to cause display of an aggregate data collection interface, wherein sending the aggregate data collection information causes the one of the plurality of enterprise user devices to cause display of the aggregate data collection interface, and wherein the one or more commands directing the one of the plurality of enterprise user devices to cause display of the aggregate data collection interface indicate that a first version of the aggregate data collection interface, specific to market contributors, is to be displayed;
in response to receiving another request for output of the aggregate data collection based on the data entry information from another one of the plurality of enterprise user devices, generate, using the second plurality of key value pairs and based on the data entry information, the aggregate data collection information;
identify, based on the other request for output of the aggregate data collection, a second user of the other one of the plurality of enterprise user devices as a market reviewer; and
send, along with the aggregate data collection information, one or more commands directing the other one of the plurality of enterprise user devices to cause display of the aggregate data collection interface, wherein the one or more commands indicate that a second version of the aggregate data collection interface, specific to market reviewers and different from the first version of the aggregate data collection interface, is to be displayed, wherein the second version of the aggregate data collection interface includes a progress bar indicating progress of each market contributor, affiliated with a particular market reviewer, in providing data entry information.


US Pat. No. 11,113,321

METHOD AND DEVICE FOR MANAGING MAP DATA OF A DIGITAL MAP FOR A NAVIGATION APPARATUS

Bayerische Motoren Werke ...


1. A method for managing map data of a tiled digital map of a navigation apparatus configured to display the tiled digital map based on the map data loaded from a memory, the method comprising the acts of:storing original map data in the memory, the original map data including original map tiles, each original map tile representing a geographic region of the tiled digital map, each original map tile having a validity indicator settable to one of two states that respectively identify the original map tile as either valid, indicating original map tile loading, or invalid, indicating updated map tile loading in lieu of the original map tile loading;
updating the tiled digital map without deleting or changing the original map tiles, wherein the updating includes:storing updated map data in the memory, the updated map data including updated map tiles associated with respective original map tiles;
after successfully storing the updated map data, setting to invalid the respective validity indicator of each original map tile for which a respective updated map tile was stored, and continuing to store the original map tiles and the updated map tiles in the memory during subsequent updating; and

loading, from the memory and for display by the navigation apparatus, the tiled digital map according to the following constraints: load respective original map tiles whose validity indicators are set to valid, and otherwise load respective updated map tiles.

US Pat. No. 11,113,320

VERSIONED CHANGE PROPAGATION

HERE Global B.V., Eindho...


1. A method comprising:identifying, with a processor, a first geographic database;
updating, with the processor, the first geographic database to a second geographic database at a first time with a schema change;
updating, with the processor, the first geographic database to a third geographic database at a second time with a first map data change, wherein the second time is later than the first time;
identifying a second map data change;
accessing a rule that defines how a field in the schema change for the second geographic database is handled in the third geographic database without the schema change;
propagating the second map data change to the third geographic database without the schema change according to the rule; and
propagating the second map data change to the second geographic database with the schema change.

US Pat. No. 11,113,319

HIERARCHICAL DATABASE MONITORING

UnitedHealth Group Incorp...


1. A computer-implemented for generating a database monitoring data object for a hierarchical database comprising entity-related data associated with a plurality of hierarchical entities, the computer-implemented method comprising:for each hierarchical entity of the plurality of hierarchical entities, identifying one or more related hierarchical entities of the plurality of hierarchical entities, wherein the one or more related hierarchical entities comprise the corresponding hierarchical entity and any hierarchical entities of the plurality of hierarchical entities that depend from the corresponding hierarchical entity;
for each hierarchical entity of the plurality of hierarchical entities, identifying an entity tracking data object of a plurality of entity tracking data objects, wherein the entity tracking data object comprises an entity invalidation status for the corresponding hierarchical entity;
for each hierarchical entity of the plurality of hierarchical entities whose entity invalidation status indicates a valid entity status, updating the plurality of entity tracking data objects by:(a) determining, based at least in part on the entity-related data, an entity invalidation condition associated with the corresponding hierarchical entity,
(b) determining whether the entity invalidation condition associated with the corresponding hierarchical entity indicates an invalid entity condition or a modified entity condition,
(c) responsive to determining that the entity invalidation condition associated with the corresponding hierarchical entity indicates the invalid entity condition, performing a non-replicating invalidation of the corresponding hierarchical entity, wherein performing the non-replicating invalidation of the corresponding hierarchical entity comprises updating each entity tracking data object for a related hierarchical entity of the one or more related hierarchical entities associated with the corresponding hierarchical entity to invalidate the related hierarchical entity, and
(d) responsive to determining that the entity invalidation condition associated with the corresponding hierarchical entity indicates the modified entity condition, performing a replicating invalidation of the corresponding hierarchical entity, wherein performing the replicating invalidation of the corresponding hierarchical entity comprises updating each entity tracking data object for a related hierarchical entity of the one or more related hierarchical entities associated with the corresponding hierarchical entity to invalidate the related hierarchical entity, generating a modified entity tracking data object for the corresponding hierarchical entity, and generating a replicated tracking data object for each related hierarchical entity of the one or more related hierarchical entities associated with the corresponding hierarchical entity other than the corresponding hierarchical entity; and

subsequent to updating the plurality of entity tracking data objects:(a) generating the database monitoring data object based at least in part on the plurality of entity tracking data objects, and
(b) performing monitoring of the hierarchical database based at least in part on the database monitoring data object.


US Pat. No. 11,113,318

CHARACTER BASED MEDIA ANALYTICS

The Nielsen Company (US),...


1. A computer-implemented method for analyzing a plurality of media content, the method comprising:accessing respective character models of multiple female characters represented in the plurality of media content from an indexed table of a database;
determining, based on the respective character models of the multiple female characters, respective female attribute values of an attribute for the multiple female characters;
determining, based on the respective female attribute values, an overall female attribute value, wherein the overall female attribute value is an average of the respective female attribute values;
accessing respective character models of multiple male characters represented in the plurality of media content from the indexed table of the database;
determining, based on the respective character models of the multiple male characters, respective male attribute values of the attribute for the multiple male characters;
determining, based on the respective male attribute values, an overall male attribute value, wherein the overall male attribute value is an average of the respective male attribute values;
comparing the overall female attribute value with the the overall male attribute value, wherein comparing the overall female attribute value with the overall male attribute value comprises determining whether a difference between the overall female attribute value and the overall male attribute value satisfies a threshold; and
based on a result of the comparing, providing a notification for display, wherein the notification includes a prompt encouraging a user to decrease the difference between the overall female attribute value and the overall male attribute value.

US Pat. No. 11,113,317

GENERATING PARSING RULES FOR LOG MESSAGES

Micro Focus LLC, Santa C...


1. A non-transitory computer-readable storage medium that stores instructions that, when executed by a processor, cause the processor to:cluster a plurality of log messages into a plurality of clusters, wherein the plurality of clusters includes a given cluster, and the given cluster includes a set of log messages of the plurality of log messages;
partition the log messages of the set of log messages into a plurality of substrings;
select the given cluster;
select a subset of substrings from the plurality of substrings, wherein the selection of the subset of substrings comprises:for the given cluster, providing data to represent a recommendation of the subset of substrings for selection on a display, the recommendation being based on one or more of the substring being capable of being parsed if selected, an identity of one or more variables in the subset of substrings, the substring corresponding to a particular substring index, and the substring having at least a threshold length; and
selecting the subset of substrings from the plurality of substrings based on a first user input; and

based on the selected subset of substrings, generate a parsing rule for the plurality of substrings.

US Pat. No. 11,113,316

LOCALIZED DATA AFFINITY SYSTEM AND HYBRID METHOD

United States Postal Serv...


1. A method of processing records in a database on a plurality of processors grouped into a plurality of processor sets, the method comprising:associating, on at least one of the plurality of processors, each record with a target record set of a plurality of record sets, the target record set identified by a remainder of an equation R modulo N, where R is a record number identifying the record and N is the number of processor sets;
associating, on at least one of the plurality of processors, the target record set with a target processor set;
routing the records to the associated processor sets based on the associated record set; and
processing the records with the processor sets; and
assigning the target record set to a target database cache associated with the target processor set based on the equation R modulo N, wherein the target database cache comprises only the target record set.

US Pat. No. 11,113,315

SEARCH KEYWORD GENERATION

Branch Metrics, Inc., Re...


1. A method comprising:acquiring, at a computing device, application data for a plurality of applications, wherein the application data for each application specifies one of a plurality of application categories and includes application words that describe the application;
determining, at the computing device, a global fraction value, a category fraction value, and a ratio value for each of the application words, wherein the global fraction value indicates the fraction of applications in the plurality of applications that include the application word, wherein the category fraction value indicates the fraction of applications in the associated category that include the application word, and wherein the ratio value indicates the ratio of the category fraction value to the global fraction value for the application word;
classifying, at the computing device, application words as categorical words when the ratio value associated with the application words is greater than a ratio threshold;
for each application, identifying similar applications based on similarity between the application words for the application and the application words for the similar applications;
for each application, setting categorical words as categorical search keywords for the application when the categorical words are included in greater than a threshold number of similar applications;
receiving, at the computing device, a search query from a user device;
identifying, at the computing device, search result applications based on matches between terms of the search query and categorical search keywords associated with the search result applications; and
sending, from the computing device, search results to the user device including download links for the search result applications.

US Pat. No. 11,113,314

SIMILARITY CALCULATING DEVICE AND METHOD, AND RECORDING MEDIUM

NEC CORPORATION, Tokyo (...


1. A similarity calculation device comprising:a memory storing therein a computer-program;
at least one processor to access the memory; and
similarity index storage storing a similarity index in which a node storing an attribute value related to a similarity of data comprising a first image of a first physical object and a second image of a second physical object is hierarchically configured in such a way as to represent a similarity relation between the data; wherein
the at least one processor executes the computer-program to implement:
generating, for each piece of the data, a label based on a path indicating a position of the node storing the attribute value in the similarity index;
the similarity calculation device further comprises:
data storage storing, for each piece of the data, information associating the attribute value with the label; and
the at least one processor is further configured to implement: for data indicated by whole or part of the information stored in the data storage, reconfiguring the similarity index, based on the label, and executing a similarity-based calculation targeted for the whole or part of the data by use of the reconfigured similarity index to determine whether the first physical object appearing in the first image is a same physical object as the second physical object appearing in the second image,
wherein, when the data storage stores, distributedly in a plurality of blocks, the information associating the attribute value with the label,
the at least one processor is further configured to implement redistributing the information associating the attribute value with the label in a plurality of blocks, based on a prefix of the label, then stores the information in the data storage, and, for data indicated by the information stored in each of redistributed blocks, executes the similarity-based calculation by use of the similarity index which is reconfigured, based on the label, to determine whether the first physical object appearing in the first image is a same physical object as the second physical object appearing in the second image,
wherein the device improves efficiency in object recognition as to whether the first physical object within the first image is the same object as the second physical object within the second image via reconfiguration of the similarity index and execution of the similarity-based calculation target by use of the reconfigured similarity index.

US Pat. No. 11,113,313

FAST PATH TRAVERSAL IN A RELATIONAL DATABASE-BASED GRAPH STRUCTURE

International Business Ma...


1. A computer-implemented method, comprising:obtaining a first plurality of relational tables from a relational database, wherein each table of the first plurality of relational tables stores connectivity information for a graph that comprises a plurality of nodes and a plurality of edges connecting the plurality of nodes, wherein each node of the plurality of nodes represents a data item stored in the relational database, each edge represents a relationship between two data items represented by two nodes of the plurality of nodes, and wherein each node of the plurality of nodes is assigned an initial identifier;
clustering the plurality of nodes into a plurality of clusters, wherein each cluster of the plurality of clusters contains a subset of the plurality of nodes;
assigning to each node in the plurality of nodes a new identifier; and
constructing a second plurality of relational tables, wherein each table of the second plurality of relational tables stores connectivity information for the graph, and wherein each node of the plurality of nodes is identified in the second plurality of relational tables by the new identifier, such that a number of data blocks that must be loaded to a computer memory to traverse a path through the graph is minimized by reading index records from a relational table of the second plurality of relational tables.

US Pat. No. 11,113,312

RELIABLE HIERARCHICAL STORAGE MANAGEMENT WITH DATA SYNCHRONIZATION

Microsoft Technology Lice...


1. A system comprising:a processor; and
machine readable instructions, stored on a tangible machine readable medium, when executed by the processor, configure the processor to:host a file system, the file system representing a replica of file systems hosted on a plurality of nodes, each of the plurality of nodes storing data on a first storage medium;
store data associated with the file system on a second storage medium, the second storage medium being remote from the plurality of nodes and slower to process data stored thereon than the first storage medium used by each node of the plurality of nodes to store data;
store on the second storage medium a file received from one of the plurality of nodes when the file remains un-accessed by the plurality of nodes for a predetermined period of time, the first storage medium on the plurality of nodes storing a pointer to the file and not the data content of the file stored on the second storage medium;
provide the file from the second storage medium to the first storage medium on one of the plurality of nodes using the pointer on the first storage medium of the one of the plurality of nodes while providing the plurality of nodes read and write access to the file stored on the second storage medium; and
allow concurrent opens of the file across the plurality of nodes without providing the data content of the file to the first storage medium of each node of the plurality of nodes, wherein the machine readable instructions further configure the processor to synchronize metadata of the file to the file systems on the plurality of nodes prior to completion of opening the file on a node requesting an open of the file.


US Pat. No. 11,113,311

TECHNOLOGY AGNOSTIC SYSTEM AND METHOD FOR ACHIEVING EVENTUALLY-CONSISTENT DATA REPLICATION

WALMART APOLLO, LLC, Ben...


1. A system comprising:one or more processors; and
one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform:receiving a write request for an object;
performing a write operation for the object, after the write request is received, comprising:adding an intent record to a tracker table, the intent record comprising (a) a primary key uniquely associated with the object and (b) a version associated with the object; and
updating the object, the object including the primary key and the version, in a primary data store, after the intent record is added to the tracker table; and

reconciling each intent record that is stranded in the tracker table, wherein the tracker table comprises one or more stranded intent records, which comprise the each intent record that is stranded in the tracker table, and wherein the reconciling comprises, for a respective stranded intent record of the one or more stranded intent records:attempting to obtain, from the primary data store, a primary object that is uniquely associated with a stranded primary key of the respective stranded intent record;
when (a) the primary object is obtained and (b) a primary object version of the primary object is equal to a stranded intent version of the respective stranded intent record, replicating the primary object from the primary data store to a secondary data store;
when the primary object is not obtained, deleting the object from the secondary data store; and
when at least one of: (a) the primary object is not obtained, (b) the primary object version of the primary object is not equal to the stranded intent version of the respective stranded intent record, or (c) the primary object from the primary data store is replicated to the secondary data store:clearing the respective stranded intent record from the tracker table.




US Pat. No. 11,113,310

METHOD AND SYSTEM FOR IDENTIFYING ISSUES AND CONFLICTS WITH BUILDING CONSTRUCTION


1. A computer-implemented method comprising:receiving, by one or more processors, a model of a building associated with required regulations, the model comprise of a plurality of assemblies, and each assembly comprise of a plurality of members;
analyzing, by the one or more processors, each of the plurality of members for internal conflicts; wherein the internal conflict is determined based on a connection of a series of members and the required regulations;
analyzing, by the one or more processors, each of the plurality of members for member-to-member conflicts;
analyzing, by the one or more processors, each of the plurality of assemblies that has not member-to-member conflict for assembly-to-assembly conflicts, wherein an assembly-to-assembly conflict involve at least one member of each of the assemblies involved in the internal conflict;
analyzing, by the one or more processors, the members of the assemblies involved in the assembly-to-assembly conflicts;
identifying, by the one or more processors, each of the members involved in the at least one of member-to-member conflict and assembly-to-assembly conflict as conflicting members, wherein each the identified conflicting members are marked in the model;
analyzing, by the one or more processors, each of the member of the plurality of assemblies that are identified as non-conflicting members with mating assemblies or mating members for mating conflicts; wherein the mating conflict is determined when the assemblies and individual member are not properly mate based on required tolerance and bearing area which thereby results in a unsafe building;
generating, by the one or more processors, a list of all the members involved in the at least one of member-to-member conflict, assembly-to-assembly conflict and mating conflicts;
determining, by the one or more processors, a solution to correct the members involved in the at least one of member-to-member conflict, assembly-to-assembly conflict and mating conflicts by using a machine learning algorithm;
and implementing the solution into the model to conform the required regulations.

US Pat. No. 11,113,309

ATTRIBUTE SHARING PLATFORM FOR DATA PROCESSING SYSTEMS

Capital One Services, LLC...


1. A method, comprising:receiving, by a processor, a first request to compute a value of an attribute based on a first set of data variables from a first data processing application;
identifying, by the processor, for the attribute, and based on a map of attributes to a plurality of computing servers, a computing server associated with source code for computing the value of the attribute,the source code being written in a first programming language, and
the attribute being included in the map of attributes;

transmitting, by the processor and based on the attribute being mapped to the computing server, a second request to the computing server,the second request including data specifying:the attribute, and
the first set of data variables, and

the computing server being configured to execute the source code, written in the first programming language, to compute the value of the attribute based on the first set of data variables;

receiving, by the processor and from the computing server, a first attribute value based on the source code being used to compute the value of the attribute; and
transmitting, by the processor, the first attribute value as an input for the first data processing application.

US Pat. No. 11,113,308

METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR IMPROVING NETWORK DATABASE FUNCTIONALITIES

GROUPON, INC., Chicago, ...


1. A computer-implemented method for improving network database precision and recall, the computer-implemented method comprising:receiving, from a client device, a network database search query associated with one or more network databases;
in response to receiving the network database search query, querying the one or more network databases to identify a plurality of datasets;
determining a plurality of taxonomy attributes, each of the plurality of taxonomy attributes being associated with at least one dataset of the plurality of datasets;
calculating a taxonomy entropy based on the plurality of taxonomy attributes;
comparing the taxonomy entropy to an entropy threshold;
in response to the taxonomy entropy satisfying the entropy threshold, generating a dataset ranking based on relevance scores associated with the plurality of datasets;
dynamically generating one or more taxonomy refinements based on the dataset ranking;
calculating a refinement count for the one or more taxonomy refinements;
determining whether the refinement count satisfies a refinement maximum threshold; and
in response to determining that the refinement count satisfies the refinement maximum threshold:aggregating the plurality of taxonomy attributes at a parent taxonomy level;
generating a taxonomy tree based at least in part on the one or more taxonomy refinements, wherein the taxonomy tree is configured to link the one or more taxonomy refinements to the plurality of datasets; and
outputting, to the client device, the plurality of datasets and the taxonomy tree to improve the network database precision and recall.


US Pat. No. 11,113,307

ENTITY IDENTIFIER SYNCHRONIZATION ACROSS DATA CENTERS

ORACLE INTERNATIONAL CORP...


1. A computer-implemented method comprising:detecting a plurality of data changes at a first data center of a plurality of data centers, each data change of the plurality of data changes corresponding to a modification to an existing data structure or an addition of a new data structure in the first data center, wherein the existing data structure or the new data structure are associated with a first entity identifier, and wherein the existing data structure or the new data structure includes metadata that indicates a characteristic of one or more previous communications transmitted from a computer system associated with the first entity identifier; and
for each data change of the plurality of data changes:determining a type of data being modified or added as a result of the data change;
identifying one or more second entity identifiers that are associated with the first entity identifier, each second entity identifier of the one or more second entity identifiers being associated with a data structure in a different data center of a plurality of data centers from the first data center;
for each second entity identifier of the one or more second entity identifiers:generating a priority metric for the data change that is based on the type of data and the second entity identifier;
determining that the priority metric for the data change exceeds a threshold value; and
transmitting, in response determining that the priority metric for the data change exceeds the threshold value and to the different data center of the plurality of data centers, a priority communication representing the data change to facilitate synchronizing the modification to the existing data structure stored at the first data center with a corresponding data structure stored at the different data center or storage of the new data structure at the different data center;

defining a set of data changes from the plurality of data changes that includes data changes having at least one second entity identifier in which a priority communication was not transmitted;
for each data change in the set of data changes:identifying at least one other data center from the plurality of data centers that is subscribed to receive synchronization updates corresponding to the first entity identifier; and
transmitting, to each of the at least one other data center, a non-priority communication representing the data change to facilitate synchronizing the modification to the existing data structure stored at the first data center with a corresponding data structure stored at the other data center.



US Pat. No. 11,113,306

METHODS AND APPARATUS FOR PERSON-CENTRIC MULTICHANNEL OPINION MINING IN DATA LAKES

EMC IP Holding Company LL...


1. A method, comprising the steps of:obtaining multi-channel heterogeneous data from a plurality of channels, wherein said plurality of channels comprise at least two of social media channels, call center channels, chat channels, email channels and an Internet channel;
aggregating said multi-channel heterogeneous data from said plurality of channels into a data lake;
identifying one or more target entities that are targets of opinion information across said plurality of channels;
extracting a plurality of user identities from said plurality of channels;
aligning, using at least one processing device of said data lake, said plurality of extracted user identities across said plurality of channels to link common user identities;
identifying, using the at least one processing device of said data lake, one or more of said target entities that are targets of said opinion information of said extracted user identities;
linking, using the at least one processing device of said data lake, said opinion information of said extracted user identities with a linked common user identity associated with an opinion holder that expressed said opinion information;
determining, using the at least one processing device of said data lake, a sentiment classification of said opinion information indicating whether said opinion information of said opinion holder comprises one or more of a positive opinion and a negative opinion by identifying subjective information within said opinion information and applying a trained classifier to said subjective information to determine said sentiment classification, wherein said trained classifier is trained by applying a supervised learning technique to a training dataset having labeled sentiment classifications;
clustering, using the at least one processing device of said data lake, a plurality of linked common user identities into a plurality of node clusters such that each node cluster comprises a plurality of linked common user identities expressing opinion information about related target entities;
providing, using the at least one processing device of said data lake, a summary of a plurality of said opinion information of at least one opinion holder having an associated linked common user identity across said plurality of channels with respect to said one or more target entities; and
initiating, using the at least one processing device of said data lake, a communication to at least one of said linked common user identities in a given node cluster based at least in part on an evaluation of one or more of a frequency of said opinion information and said sentiment classification of said opinion information.

US Pat. No. 11,113,305

MODELING OF A NON-RELATIONAL DATABASE AS A NORMALIZED RELATIONAL DATABASE

Progress Software Corpora...


1. A method comprising:receiving, using one or more processors, a relational query from a client;
obtaining, using the one or more processors, a relational model of a column-oriented, non-relational database, wherein the column-oriented, non-relational database includes a first column having a first type and a second column having a second type, and wherein the relational model includes catalog information representing a parent table including the first column having the first type and catalogue information representing a child table including the second column having the second type, wherein the parent table and child table are both represented as relational tables; and
translating, using the one or more processors, the relational query into a non-relational query using the relational model.

US Pat. No. 11,113,304

TECHNIQUES FOR CREATING COMPUTER GENERATED NOTES

MAKE SENCE, INC.


1. An apparatus for generating notes of content from an information resource system, the apparatus comprising:a processor, a computer readable memory and a computer-readable storage medium;
program instructions stored on the computer-readable storage medium, the program instructions executable by the processor to cause the processor to:receive an information resource associated with the information resource system;
decompose the information resource using an intermediate format by pairing a first relatum with a second relatum based on a relation between the first relatum and the second relatum, the relation being defined by a context provided by a structure of the information resource;
generate a node based on the decomposing, the node being a data structure including the first relatum, the relation between the first relatum and the second relatum, and the second relatum;
extract a note from the generated node, the note being a text object;
store the note;
receive a user selection of one or more of a plurality of stored notes from a note selection window; and
execute a computer-based instruction involving the one or more of the plurality of stored notes based on the user selection.


US Pat. No. 11,113,303

OWNERSHIP TRANSFER OF DATABASE ARTIFACTS BETWEEN FILES

SAP SE, Walldorf (DE)


1. A computer-implemented method, including:deploying a new artifact file in a deployment infrastructure container associated with a database, wherein the deployment infrastructure container is separate from the database, the new artifact file providing specifications for one or more new run-time database objects to be created in the database by processing of the new artifact file, including:processing the new artifact file to create the one or more new run-time database objects;
assigning ownership of the one or more new run-time database objects in the database to the new artifact file, wherein ownership signifies that the new run-time database objects are to be deployed when owned, and deleted or dropped when not owned; and
in response to an existing database object in the database provided by another artifact file corresponding to a new run-time database object specified in the new artifact file, transferring ownership of the existing database object in the database from the another artifact file to the new artifact file being deployed instead of undeploying the existing database object, wherein the another artifact file has been deployed, and wherein the new artifact file is being deployed.


US Pat. No. 11,113,302

UPDATING ONE OR MORE DATABASES BASED ON DATAFLOW EVENTS

SALESFORCE.COM, INC., Sa...


1. A computer program for a database for managing customer data, the customer data having external data and internal data based at least in part on the external data, and the database having a scheduler to manage running a first dataflow, the computer program comprising a set of instructions operable to:periodically retrieve a portion of the customer data in a first format;
cache the portion of the customer data in a second format;
perform a first dataflow on the cached customer data;
determine one or more dataset modified by the first dataflow;
identify a trigger having associated therewith a criteria for changes to the one or more dataset, the trigger to specify a second dataflow different from the first dataflow; and
automatically perform the second dataflow responsive to the criteria being satisfied.

US Pat. No. 11,113,301

GENERATING METADATA FOR EVENTS BASED ON PARSED LOCATION INFORMATION OF DATA CHUNKS OF AN ISOLATED EXECUTION ENVIRONMENT

Splunk Inc., San Francis...


1. A method, comprising:obtaining a chunk of data from a data store in a hosted computing environment, the hosted computing environment comprising:a host computing device, the host computing device including the data store,
a plurality of isolated execution environments instantiated on the host computing device, wherein the plurality of isolated execution environments share compute resources of the host computing device, and wherein each isolated execution environment of the plurality of isolated execution environments is isolated from other isolated execution environments of the plurality of isolated execution environments, and
an isolated execution environment manager executing on the host computing device, wherein the isolated execution environment manager is communicatively coupled with the plurality of isolated execution environments and is configured to manage compute resource allocation of the host computing device;

obtaining location information of the chunk of data, wherein the location information includes a storage location of the chunk of data in the host computing device;
parsing the location information to determine an identity of a plurality of components of the hosted computing environment associated with the chunk of data, the plurality of components including a particular isolated execution environment of the plurality of isolated execution environments that is generated a first portion of the chunk of data wherein the isolated execution environment manager generates a second portion of the chunk of data;
generating metadata using the determined identity of the plurality of components;
generating, at a data intake and query system, an event based on the chunk of data, wherein the event includes the first portion of the chunk of data; and
associating the metadata with the event.

US Pat. No. 11,113,300

SYSTEM AND METHOD FOR ENABLING INTEROPERABILITY BETWEEN A FIRST KNOWLEDGE BASE AND A SECOND KNOWLEDGE BASE

Babylon Partners Limited,...


1. A computer-implemented method of enabling interoperability between a first knowledge base and a second knowledge base,wherein each knowledge base is graphically represented and includes a plurality of nodes each defining a concept and a plurality of relations linking the plurality of nodes,
wherein the first knowledge base and the second knowledge base are encoded using different coding standards, the method comprising:
identifying a first node in the second knowledge base;
identifying a first node in the first knowledge base that partially matches the first node in the second knowledge base, wherein identifying a partial match comprises identifying a key word of the first node in the first knowledge base within a key word of the first node in the second knowledge base;
identifying a second node in the first knowledge base that partially matches the first node in the second knowledge base;
adding a second node to the second knowledge base that matches the first node from the first knowledge base, and a third node to the second knowledge base that matches the second node from the first knowledge base;
generating and storing a link between the second node from the second knowledge base and the first node from the first knowledge base, and a link between the third node from the second knowledge base and the second node from the first knowledge base; and
generating and storing a relation between the first node from the second knowledge base and the second node from the second knowledge base, and between the first node from the second knowledge base and the third node from the second knowledge base, wherein:
the nodes in the first and second knowledge bases each include a label,
identifying the first node from the first knowledge base includes searching the first knowledge base for one or more labels having a key word of one or more key words matching a key word of one or more key words of a label of the first node from the second knowledge base,
identifying the second node in the first knowledge base includes searching the first knowledge base for one or more labels having a key word of one or more key words matching a key word of one or more key words of a label of the first node from the second knowledge base,
adding the second node to the second knowledge base comprises adding the second node to the second knowledge base to include a label having an exact linguistic match to the label of the first node from the first knowledge base, and
adding the third node to the second knowledge base comprises adding the third node to the second knowledge base to include a label having an exact linguistic match to the label of the second node from the first knowledge base.

US Pat. No. 11,113,299

SYSTEM AND METHOD FOR METADATA TRANSFER AMONG SEARCH ENTITIES

Apple Inc., Cupertino, C...


1. A non-transitory machine readable medium containing executable program instructions which when executed by a data processing device cause the device to perform a method comprising:selecting a plurality of objects by retrieving a plurality of citations that are composed by the plurality of subjects citing one or more of a plurality of objects that fit searching criteria;
identifying at least one incomplete attribute from the one or more of the plurality of objects and at least one identified attribute from the plurality of the citations corresponding to the at least one incomplete attribute from the one or more of the plurality of objects;
transferring the at least one identified attribute from the plurality of the citations to the one or more of the plurality of objects that is having the at least one incomplete attribute, wherein the attributes are applicable to the one of the plurality of objects;
ranking the plurality of objects cited by the plurality of citations using one or more attributes, wherein the one or more attributes include the at least one identified attribute transferred from the plurality of citations;
displaying at least some of the plurality of objects.

US Pat. No. 11,113,298

COLLABORATING USING DIFFERENT OBJECT MODELS

Palantir Technologies Inc...


1. A system comprising:one or more processors; and
a memory storing one or more databases and instructions that, when executed by the one or more processors, cause the system to perform:receiving a source object stored in a first object model and associated with an entity, the source object containing at least two of an attribute, a file, an image, and a video;
conducting a search query corresponding to a target object, the target object containing at least two of a second attribute, a second file, a second image, and a second video;
identifying one or more aliases for the source object based on a match between respective attributes, files, images or videos of the source object and the one or more aliases;
identifying one or more second aliases for the target object based on a match between respective attributes, files, images or videos of the target object and the one or more second aliases;
identifying, based on a common alias between the source object and the target object, a match between the source object and the target object, the common alias including a term absent from both the source object and the target object, wherein each term in the common alias is distinct from each term in the target object;
in response to identifying a match between the source object and the target object, consolidating the source object and the target object to create a consolidated data object, wherein the consolidated data object includes at least two of the attribute, the file, the image, and the video and at least two of the second attribute, the second file, the second image, and the second video; and
removing the target object and the source object and replacing the target object and the source object with the consolidated data object.


US Pat. No. 11,113,297

INFORMATION PROCESSING DEVICE AND INFORMATION TERMINAL

Qufooit Japan Ltd., Toky...


1. An information processing device adapted to provide a computer program to a user terminal having a processor for accessing a website having a plurality of articles, the computer program being adapted cause the processor of the user terminal to function as:a display module that causes a first article of the plurality of articles of the website selected by a user to be displayed and causes a search window to be displayed; and
a search module that searches for a second article related to a character string entered in the search window via an Ajax communication with a search server by using an XMLHttpRequest object, wherein
the display module causes information related to the second article, that is identified by a search using the search module, and that is related to the character string entered in the search window, to be displayed near the search window, and
the display module causes information related to the second article to be displayed dynamically during the search for the second article by the search module, wherein
the computer program causes the processor of the user terminal to further function as an acquisition module that, in coordination with an external device that acquires, from a plurality of user terminals, information on a position in the first article where users stop viewing, performs a statistical process based on the information acquired from the plurality of user terminals, and generates statistical information related to the position in the first article where the users stop viewing, acquires information on a position where the search window should be displayed based on the statistical information, and
the display module causes the search window to be displayed in the middle of the first article in accordance with the information on the position acquired by the acquisition module.

US Pat. No. 11,113,296

METADATA MANAGEMENT FOR A TRANSACTIONAL STORAGE SYSTEM

Google LLC, Mountain Vie...


1. A method comprising:receiving, at data processing hardware, a query request at a snapshot timestamp, the query request requesting return of any data blocks from a plurality of data blocks stored on memory hardware in communication with the data processing hardware that match query parameters, each data block comprising:a corresponding write epoch timestamp indicating a point in time the data block was stored on the memory hardware; and
a corresponding conversion indicator indicating whether the data block is active at the snapshot timestamp or has been converted at a respective conversion timestamp occurring at or before the snapshot timestamp;

setting, by the data processing hardware, a read epoch timestamp equal to the earliest one of the write epoch timestamps corresponding to the data blocks that are active at the snapshot timestamp;
determining, by the data processing hardware, whether any of the respective conversion timestamps occurring at or before the snapshot timestamp occur after the read epoch timestamp; and
when none of the respective conversion timestamps occurring at or before the snapshot timestamp occur after the read epoch timestamp, determining, by the data processing hardware, whether any data blocks match the query parameters indicated by the query request by scanning each of the data blocks comprising corresponding write epoch timestamps occurring at or after the read epoch timestamp.

US Pat. No. 11,113,295

BUILDING MANAGEMENT SYSTEM WITH DECLARATIVE VIEWS OF TIMESERIES DATA

Johnson Controls Technolo...


1. A timeseries management system comprising:one or more non-transitory computer-readable storage media having instructions stored thereon that, when executed by one or more processors, cause the one or more processors to:receive one or more timeseries processing workflows that apply to raw data timeseries, each of the timeseries processing workflows comprising a sequence of timeseries processing operations, wherein the timeseries processing workflows comprise:an indication of one or more input timeseries to which the workflow applies;
a particular sequence of timeseries processing operations, wherein the particular sequence of timeseries processing operations is at least one of a dynamically defined sequence of timeseries processing operations or a predefined sequence of timeseries processing operations; and
an indication of one or more derived data timeseries generated by applying the dynamically defined sequence of timeseries processing operations or the predefined sequence of timeseries processing operations to the input timeseries;

identify the one or more timeseries processing workflows that apply to the raw data timeseries;
process the raw data timeseries using the identified timeseries processing workflows to generate the one or more derived data timeseries; and
generate a plurality of directed acyclic graphs, each directed acyclic graph corresponding to one of the timeseries processing workflows and representing the sequence of timeseries processing operations in the corresponding workflow;
wherein each directed acyclic graph comprises one or more blocks representing at least one of one or more input timeseries to which the corresponding workflow applies, the sequence of timeseries processing operations in the corresponding workflow, or the one or more derived data timeseries generated by applying the predefined sequence of timeseries processing operations to the input timeseries.


US Pat. No. 11,113,294

RECOMMENDING QUERY TEMPLATES DURING QUERY FORMATION

Splunk Inc., San Francis...


1. A method, comprising:identifying a token search query parameter in least a portion of a search query entered in a user interface, wherein the search query is associated with a tenant of a search query system;
identifying a plurality of search query templates based at least in part on the identified token search query parameter, wherein the plurality of search query templates correspond to a plurality of previously executed search queries associated with a plurality of tenants of the search query system, and wherein each search query template of the plurality of search query templates includes a sequence of search query commands and a plurality of search query parameter placeholders;
identifying, for each of the plurality of search query templates, a plurality of search query parameters for the plurality of search query parameter placeholders based on the tenant;
for each of the plurality of search query templates, replacing the plurality of search query parameter placeholders with the identified plurality of search query parameters to form a plurality of suggested search query templates; and
causing the user interface to display the plurality of suggested search query templates, wherein selection of a suggested search query template of the plurality of suggested search query templates causes the suggested search query template to be included as at least a portion of the search query.

US Pat. No. 11,113,293

LATENT NETWORK SUMMARIZATION

Adobe Inc., San Jose, CA...


1. One or more computer storage media storing computer-useable instructions that, when used by one or more computing devices, cause the one or more computing devices to perform operations comprising:accessing an input graph comprising nodes and edges connecting the nodes;
accessing one or more initial node-specific feature vectors corresponding to each node;
generating a latent summary of the input graph by:constructing a base feature matrix by applying, in a corresponding neighborhood for each node, a base function to the one or more initial node-specific feature vectors for the node; and
constructing a multi-level representation comprising a feature matrix at each of a plurality of levels by iteratively applying a relational function based on the base feature matrix, wherein the latent summary includes the relational function and the multi-level representation; and

providing the latent summary to facilitate performing a graph-based task based on the latent summary.

US Pat. No. 11,113,292

FEATURE DATA STORAGE APPARATUS AND DRIVING FEATURE AND DISTRIBUTION DATABASES

DENSO CORPORATION, Kariy...


1. A feature data storage apparatus for storing distributions of feature data items that are based on driving information items collected from a plurality of vehicles, the feature data storage apparatus comprising:a feature database configured to store the feature data items and attribute data items such that each of the feature data items correlates to at least one of the attribute data items, each of the attribute data items representing an attribute of at least one of the feature data items;
a distribution database configured to store distribution information items respectively representing feature distributions, each of the feature distributions including a set of selected feature data items in the feature data items stored in the feature database, the set of the selected feature data items correlating to a common one of the attribute data items, each of the distribution information items being stored to correlate to the common one of the attribute data items, the distribution information items including a first distribution information item and a second distribution information item, the first distribution information item being stored to correlate to a first common one of the attribute data items, the second distribution information item being stored to correlate to a second common one of the attribute data items, the first common one of the attribute data items being different from the second common one of the attribute data items, the second distribution information item being different from the first distribution information item; and
a computer configured to:calculate, in accordance with a maximum mean discrepancy, a similarity level between:a target feature distribution represented by the first distribution information item stored in the distribution database; and
a comparative feature distribution represented by the second distribution information item stored in the distribution database, the maximum mean discrepancy being a distance measure indicative of the similarity level between the target and comparative feature distributions;


determine whether the calculated similarity level is equal to or higher than a predetermined threshold; and
integrate the target feature distribution and the comparative feature distribution into a common feature distribution upon determining that the calculated similarity level is equal to or higher than the predetermined threshold.

US Pat. No. 11,113,291

METHOD OF AND SYSTEM FOR ENRICHING SEARCH QUERIES FOR RANKING SEARCH RESULTS

YANDEX EUROPE AG, Lucern...


1. A computer-implemented method for ranking search results in response to a current query using a first machine learning algorithm (MLA), the method executable by a server, the server being connected to a database, the server being connected to an electronic device via a communication network, the method comprising:receiving, by the server from the electronic device, an indication of the current query;
generating, by the server, a set of search results, the set of search results containing a set of current documents relevant to the current query, a given current document of the set of current documents being associated with past user interactions of some of a plurality of past users with the given document presented in response to a past query;
retrieving, by the server from the database, a plurality of past queries, each given past query of the plurality of past queries being associated with a respective set of past documents,the respective set of past documents having been presented as search results in response to the given past query of at least some others of the plurality of past queries, each past document of the respective set of past documents being associated with the past user interactions with the respective past document presented in response to the given past query;

computing, by the server, a respective similarity parameter between the current query and a respective one of the plurality of past queries, the respective similarity parameter being indicative of a degree of similarity between the current query and the respective one of the plurality of past queries, the computing for a given one of the plurality of past queries being based on:(i) the degree of similarity between current documents in the set of current documents and past documents in the respective set of past documents associated with the given one of the plurality of queries;
(ii) the degree of similarity between the past user interactions with current documents in the set of current documents and the past user interactions with past documents in the respective set of past documents associated with the given one of the plurality of queries;

selecting a subset of the plurality of the past queries based on the respective similarity parameter being above a predetermined similarity threshold;
ranking the set of current documents to obtain a ranked set of documents, the ranking being done by the first MLA, the first MLA taking into account the subset of the plurality of past queries as a ranking feature; and
transmitting, by the server, a search engine results page (SERP) for display on the electronic device, the SERP including the ranked set of documents.

US Pat. No. 11,113,290

INFORMATION VISUALIZATION DISPLAY USING ASSOCIATIVE CLUSTERED TILING AND TESSELLATION

CLUSTER COMMUNICATIONS, I...


1. A method for information visualization designed to (a) dynamically organize the information via associative clustered tiling and tessellation, and then to (b) present instantly addressable and accessible said information content via an electronic user interface, including mobile devices such as touch screen cellular phones, and tablets, comprising the steps of (i) inputting structured data and unstructured data into an initial preprocessor, (ii) inputting data from the initial preprocessor into a metadata preprocessor, (iii) inputting proprietary data into a portion of the metadata preprocessor, (iv) inputting data from the initial preprocessor into a display data preprocessor, (v) inputting data from the metadata preprocessor into a cell ranking processor, (vi) inputting data from the display data preprocessor into an associative clustered tiling processor subject to user direction, (vii) exchanging archived data with portions of the cell ranking processor, (viii) outputting data from the cell ranking processor subject to user direction into the associative clustered tiling processor, and (ix) inputting user/proprietary data, into the pre-tiling area designation processor in the associative clustered tiling processor, and (x) outputting data from the associative clustered tiling processor as tessellated data for display on said electronic user interface.

US Pat. No. 11,113,289

BLENDING LEARNING MODELS FOR SEARCH SUPPORT

Apple Inc., Cupertino, C...


1. A non-transitory machine-readable medium having executable instructions to cause one or more processing units to perform a method to generate a re-ranking model used to re-rank a plurality of search results on a client device, the method comprising:sending a set of features to the server, wherein the set of features is anonymized data that includes a type of an interaction with the client device by a user of the client device and a discovery of one or more of the features will not lead to a discovery of which device contributed the set of features;
receiving a crowd-sourced intra-domain model from a server, wherein the intra-domain model is a search result re-ranking model generated based on at least device interactions of a plurality of users interacting with a plurality of other devices; and
generating, by the client device, a merged re-ranking model from the crowd-sourced intra-domain model and a local model, wherein the local model includes private data representing a device user's interaction with that device and the merged re-ranking model is used to re-rank the plurality of search results retrieved from a search domain that is one of a plurality of search domains using a search query, the search domain corresponding to the crowd-sourced intra-domain model.

US Pat. No. 11,113,288

ADVERTISEMENT DELIVERY SYSTEM WITH LOCATION BASED CONTROLLED PRIORITY MECHANISM AND METHOD OF OPERATION THEREOF

Telenav, Inc., Santa Cla...


1. A method of operation of an advertisement delivery system comprising:receiving a selection for a category of interest;
generating search results for the selection, the search results based on a current location for locating a device providing the selection;
adjusting a distance priority inversely relative to an adjustment of a relevancy priority based on a type of a geographic area where the current location is detected, wherein the distance priority is decreased while the relevancy priority is increased relative to an abundance of the category of interest within the geographic area;
generating a weighted distance based on distances of the search results from the current location and the distance priority;
generating a weighted relevancy based on relative matches of the search results and the selection;
generating a weighted customization with the search results sharing a common attribute that is predefined;
delivering a notification from the search results by an aggregation of the weighted distance, the weighted relevancy, and the weighted customization, the aggregation meeting or exceeding a threshold for displaying on the device;
tracking an acceptance trend representing a frequency of a notification acceptance of the notification when the distance priority is higher than the relevancy priority, a customization priority, or a combination thereof; and
generating a history of each aggregation for the category of interest that had met or exceeded the threshold wherein the category of interest represents a classification of a user's entry and further wherein the acceptance trend and the history are shared amongst the search results as the common attribute wherein the common attribute having a value re resenting the acceptance trend different from the value representing for the history.

US Pat. No. 11,113,287

DATA STREAM MANAGEMENT SYSTEM

Teradata US, Inc., San D...


1. A system comprising:at least one processor configured to:
receive data from a plurality of independent data sources, wherein the data from each respective data source is received at a rate determined by the respective data source;
buffer the received data in a buffer, wherein received data from different independent data sources is collectively buffered in the buffer, wherein the buffer is configured into a plurality of partitions, and wherein each partition is configured to concurrently buffer received data from different independent data sources together; and
write the buffered received data to at least one data store at a rate independent of the respective rates at which data from the plurality of independent data sources is received, wherein the at least one data store comprises an independent data store management system.

US Pat. No. 11,113,286

GENERATION OF PRUNING INDEX FOR PATTERN MATCHING QUERIES

Snowflake Inc., Bozeman,...


1. A system comprising:at least one hardware processor; and
at least one memory storing instructions that cause the at least one hardware processor to perform operations comprising:
accessing a source table organized into a set of batch units;
generating a pruning index based on the source table, the pruning index comprising a set of filters that index distinct N-grams in each column of the source table, each filter in the set of filters corresponding to a batch unit in the set of batch units, the generating of the pruning index comprising generating the set of filters, the generating of the set of filters comprising populating a cell in a first filter with a fingerprint generated based on an N-gram of a data value in the source table; and
storing, in a database, the pruning index with an association with the source table.

US Pat. No. 11,113,285

PARTITION AWARE PARTIAL QUERY PROCESSING

SAP SE, Walldorf (DE)


1. A system comprising:at least one programmable processor; and
machine-readable memory storing instructions, which when executed by the at least one processor cause the at least one programmable processor to perform operations comprising:detecting a partitioning flag and at least one set of partition attributes at a first datasource operator in a calculation scenario to be executed in a calculation engine of a database management system, the partitioning flag providing instructions to the calculation engine regarding at least one execution scope, the at least one execution scope including a table;
partitioning the table into at least one partition based on the at least one set of partition attributes, the partitioning comprising determining, based on the execution scope, to partition the table into a plurality of logical partitions and a plurality of physical partitions;
determining, based upon the detected partitioning flag, that the table is partitioned into a plurality of partitions, each partition of the plurality of partitions having at least one row corresponding to a same set of values of the at least one set of partition attributes, wherein the plurality of partitions comprises the plurality of logical partitions and the plurality of physical partitions;
assigning, based upon the detected partitioning flag, a first physical partition of the plurality of physical partitions to a first execution scope of the at least one execution scope, a second physical partition of the plurality of physical partitions to a second execution scope of the at least one execution scope, the first execution scope to a first index server, and the second execution scope to a second index server, the second index server being separate from the first index server, each of the first index server and the second index server running on a computing system having a programmable processor;
assigning, based upon the detected partitioning flag, a logical partition of the plurality of logical partitions to a third execution scope, and the third execution scope to the first index server;
duplicating at least one operator in the calculation scenario that follows the partitioning flag to form a plurality of copies of the at least one operator such that one copy of the at least one operator is provided to each of the at least one execution scope for execution on respective index servers to generate a plurality of intermediate results for each execution scope;
generating the plurality of intermediate results for each execution scope;
detecting, during the generation of the plurality of intermediate results for each execution scope, a second flag indicating a union of the intermediate results and an end of the at least one partition of the plurality of partitions, the second flag comprising instructions to union the plurality of intermediate results; and
unioning, based on the detection of the second flag, the plurality of intermediate results for further processing.


US Pat. No. 11,113,284

VIRTUAL BACKWARD ASSOCIATIONS FOR GENERIC REQUEST HANDLING BASED ON MODELS

SAP SE, Walldorf (DE)


1. A computer-implemented method for accessing a database layer through one or more data models, the method being executed by one or more processors and comprising:receiving, in response to instantiation of an application that enables access to data within the database layer, a data model provided as a computer-readable file, the data model defining a set of associations between two or more tables stored in the database layer, each association comprising a foreign key that defines a first uni-directional association between two tables;
processing the data model to provide a set of inverted associations, each inverted association being specific to a respective association in the set of associations and defining a second uni-directional association between two tables;
generating an enriched data model comprising the set of associations of the data model and the set of inverted associations; and
hosting a service that stores the enriched data model as an in-memory data object and uses the enriched data model to enable access to the data within the database layer based on one or more queries submitted from a web client during a runtime and that deletes the enriched data model after the runtime.

US Pat. No. 11,113,282

ONLINE OPTIMIZER STATISTICS MAINTENANCE DURING LOAD

ORACLE INTERNATIONAL CORP...


1. A method comprising:initiating, by a database server that manages a database, a transaction to perform a bulk load operation to insert a plurality of rows into a table that resides in the database;
as part of the transaction that performs the bulk load operation:inserting the plurality of rows into the table;
generating a set of delta statistics based on data in the plurality of rows; and
merging the set of delta statistics with pre-existing committed statistics for the table to create new statistics for the table;

after successful completion of the transaction:committing the transaction, wherein committing the transaction includes:committing the new statistics thereby creating new committed statistics, and
assigning the transaction a particular commit time;

receiving a plurality of queries, at the database server, that read data from the table;
wherein each query of the plurality of queries has a respective snapshot time that dictates which version of the table is used to answer the query;
comparing the particular commit time with snapshot times of each query of the plurality of queries, to determine whether the new committed statistics or the pre-existing committed statistics should be used for selecting execution plans for the query;
for queries, of the plurality of queries, that are assigned snapshot times after the particular commit time, selecting execution plans based on the new committed statistics; and
for queries, of the plurality of queries, that are assigned snapshot times before the particular commit time, selecting execution plans based on the pre-existing committed statistics;

wherein the method is performed by one or more computing devices.

US Pat. No. 11,113,281

EFFICIENT METHOD FOR LOGICAL COMPLETION OF A DEDUCTIVE CATALOGUE USED FOR GENERAL CONSTRAINTS TREATMENT IN THE EXTENDED RELATIONAL DATABASE CONCEPT


1. A method of applying a database query to a relational database, the database having one or more records, the database query reciting a relationship between a database record and a plurality of literals, the method including steps of:converting the database query to a plurality of clauses, each of the plurality of clauses reciting one or more literals of the plurality of literals;
converting the plurality of literals into a set of pattern strings, whereinthe set of pattern strings includes at least one selected pattern string for each literal;
for N literals, the at least one selected pattern string for the kth literal Xk, 0?k?N?1, includes:
a first pattern string including a factor (2k) copies of a first pattern, wherein the first pattern includes a factor (2N-K-1) copies of a “1” bit followed by a factor (2N-K-1) copies of a “0” bit; or
a second pattern string including a factor (2k) copies of a second pattern, wherein the second pattern includes a factor (2N-K-1) copies of a “0” bit followed by a factor (2N-K-1) copies of a “1” bit;

joining pattern strings for all literals of a particular clause by a special type of OR operation (patternOR), to represent the particular clause;
repeating the step of joining pattern strings for each of the plurality of clauses to obtain a plurality of binary trees corresponding to the plurality of clauses;
generating a result tree by joining the plurality of binary trees by a special type of AND operation (patternAND);
using the result tree to find a truth value of the plurality of clauses of the database query;
selecting database records satisfying the truth value as a response to the database query.

US Pat. No. 11,113,280

SYSTEM-WIDE QUERY OPTIMIZATION

Amazon Technologies, Inc....


1. A non-transitory computer-readable storage medium having stored thereon instructions that, when executed by a computing device, cause the computing device to at least:obtain, from a first query optimizer of a first computing node, a first plan for executing a query on the first computing node;
obtain, from a second query optimizer of a second computing node, a second plan for executing the query on the second computing node;
obtain a first number of votes cast by the first computing node, wherein the first number of votes is based on a first characteristic of the first computing node;
obtain a second number of votes cast by the second computing node for the second plan, wherein the second number of votes is based on a second characteristic of the second computing node;
determine, based on comparing the first number of votes associated with a first predicted execution cost of executing the first plan with the second number of votes associated with a second predicted execution cost of executing the second plan, that the first plan for executing the query on the first computing node is preferred for executing the query on the second computing node, wherein the first predicted execution cost is based at least in part on a first performance characteristic of the first computing node and the second predicted execution cost is based at least in part on a second performance characteristic of the second computing node; and
cause, based on the comparison, the second computing node to execute the query using the first plan.

US Pat. No. 11,113,279

MATERIALIZED VIEWS BASED ON ACCESS RIGHTS

Snowflake Inc., Bozeman,...


1. A method comprising:defining a materialized view over a source table that is associated with a first account of a database;
defining cross-account access rights to the materialized view for a second account, the cross-account access rights including view privileges to the materialized view by the second account;
modifying the source table for the materialized view;
identifying that the materialized view is stale with respect to the source table by merging the materialized view and the source table;
causing the materialized view to be refreshed with respect to the source table based on a comparison of partitions associated with the materialized view and the source table after the merging; and
sharing the refreshed materialized view to the second account in response to receiving a request from the second account to access the refreshed materialized view, the second account having access to the refreshed materialized view without copying the refreshed materialized view.

US Pat. No. 11,113,278

DATA SHARING AND MATERIALIZED VIEWS IN MULTIPLE TENANT DATABASE SYSTEMS

Snowflake Inc., Bozeman,...


1. A system comprising:means for defining a share object in a first account, the share object comprising data associated with the first account;
means for granting cross-account access rights to the share object to a second account such that the second account has access to the share object without copying the share object;
means for generating a materialized view over the share object;
means for updating the data associated with the first account; and
means for identifying whether the materialized view is stale with respect to the share object by merging the materialized view and the share object.

US Pat. No. 11,113,277

SYSTEM AND METHOD FOR REAL-TIME MATERIALIZED VIEW MAINTENANCE

INTERNATIONAL BUSINESS MA...


1. A method for maintaining a materialized view defined on a base relation of a relational database, the method comprising:generating a materialized view in a materialized view maintenance system, implemented in a computing device having at least a processor and a memory device, that is defined on one or more base relations;
generating a respective filtering relation for each base relation that captures a relationship among multiple join attributes of the base relation and includes a summary of attributes of the base relation, including all join attributes of the base relation that match a disjunctive-conjunctive equi-join condition on two base relations;
determining whether each of a plurality of updates to base relations of the materialized view is irrelevant with respect to relations in the materialized view by performing content-based filtering on each update by joining filtering relations, of base relations other than the updated base relation, to updated tuples of the updated base relation, to determine that no join result tuple is produced; and
maintaining the materialized view in accordance with at least one of the updates, omitting at least one update that is determined to be irrelevant.

US Pat. No. 11,113,276

QUERYING A DATABASE

Advanced New Technologies...


1. A computer-implemented method, comprising:receiving, as a received query, a query from a user;
determining a query event type and a query time range associated with the query;
determining an estimated amount of data to be queried associated with the query time range based on at least a historical number of the query event type of the user, wherein the historical number comprises a quantity of events of the query event type that occurred in a past time period, and wherein determining the estimated amount of data to be queried comprises:dividing the historical number by the past time period to determine an average number of the query event type of the user; and
multiplying the average number of the query event type of the user and the query time range to determine the estimated amount of data to be queried;

determining an allowable amount of data to be queried supported by a database for a single query;
determining, based on the estimated amount of data to be queried and the allowable amount of data to be queried, a quantity N of one or more sub-queries to be generated;
dividing the query time range into N time periods, wherein N?1 time periods of the N time periods have equal lengths of time;
generating, as generated one or more sub-queries, the quantity N of one or more sub-queries for the received query, wherein each sub-query is used to query data in a different time period of the N time periods, and wherein a corresponding amount of data to be queried associated with each time period is less than, or equal to, the allowable amount of data to be queried; and
querying the database with the generated one or more sub-queries.

US Pat. No. 11,113,275

VERIFYING TEXT SUMMARIES OF RELATIONAL DATA SETS

Cornell University, Itha...


1. An apparatus comprising:a processing platform comprising one or more processing devices each including at least one processor coupled to a memory;
the processing platform being configured:
to obtain a text document containing at least one claim about data of a relational database;
to extract claim keywords from the text document;
to identify query fragments based at least in part on indexing of one or more relational data sets of the relational database;
to determine relevance of the claim keywords to the query fragments;
to identify candidate queries based at least in part on probabilistic inferencing from the determined relevance of the claim keywords to the query fragments;
to evaluate the candidate queries against the relational database; and
to determine consistency of the claim with the data of the relational database based at least in part on results of the evaluation of the candidate queries;
wherein identifying candidate queries based at least in part on probabilistic inferencing from the determined relevance of claim keywords to query fragments comprises:
applying relevance scores for a set of query fragments each having above a specified threshold relevance to the claim as input to a probabilistic model; and
utilizing the probabilistic model to map the claim to a probability distribution over candidate queries based at least in part on the relevance scores for the set of query fragments.

US Pat. No. 11,113,274

SYSTEM AND METHOD FOR ENHANCED DATA ANALYTICS AND PRESENTATION THEREOF

Pointillist, Inc., Bosto...


1. A system for graphically constructing a query for processing event data and identifying connections between two or more events, the system comprising:at least one user interface comprising a canvas and a data component module, wherein the data component module comprises at least one of a search engine or a browsable hierarchy;
at least one data repository comprising a plurality of events characterized by at least a timestamp, an event type, and at least one actor; and
at least one processor;
wherein the at least one user interface is configured to accept first event criteria of a first event and to communicate with the at least one data module to list the event data related to the first event criteria;
wherein upon acceptance of the first event criteria, the at least one user interface is further configured to accept placement of the first event onto the canvas;
wherein the at least one user interface is further configured to accept second event criteria of a second event and to communicate with the at least one processor to list the event data related to the second event criteria;
wherein upon acceptance of the second event criteria, at least one user interface is further configured to accept placement of the second event onto the canvas;
wherein the at least one processor is configured to, upon the placement of the second event onto the canvas, generate a plurality of possible connections between the first event and the second event and to output the plurality of possible connections, wherein each of the plurality of possible connections comprises a link between two events specifying at least one shared actor and a time relationship between the two events,
wherein the at least one processor is further configured to list the event data related to the first event criteria or the second event criteria according to historical user entries and selections,
wherein the at least one processor is further configured to generate the plurality of possible connections between the first event and the second event according to the historical user entries and selections,
wherein the at least one processor is further configured to rank the plurality of possible connections according to the historical user entries and selections;
wherein, when there exists no shared actor between the first event and the second event, the at least one user interface displays the first event and the second event as independent of each other;
wherein the at least one processor is further configured to derive a plurality of story metrics according to the events, the at least one actor, and the connections between the events;
wherein the at least one processor is further configured to generate a story and select a connection, wherein, upon the generation of the story, the at least one processor in communication with the at least one user interface is further configured to generate a graphical representation of story metrics associated with the selected connection;
wherein the at least one processor is further configured to identify recommended additions to the query according to at least one user input, where the recommended additions include at least one of an event type, at least one common actor, at least one actor state, and a chronological relationship between all events; and
wherein the at least one processor, in communication with the at least one user interface, generates a list of the recommended additions ordered by relevance according to a chronological relationship between all events or actors shared by all events.

US Pat. No. 11,113,273

MANAGED MATERIALIZED VIEWS CREATED FROM HETEROGENEOUS DATA SOURCES

Amazon Technologies, Inc....


1. A system, comprising:at least one processor; and
a memory, storing program instructions that when executed by the at least one processor, cause the at least one processor to implement a materialized view management platform, the materialized view management platform, configured to:create a materialized view from one or more data sources that are specified as sources in a definition for a materialized view, wherein the materialized view management platform is capable of creating the materialized view from a plurality of different types of data sources, and wherein the materialized view is stored by the materialized view management platform in a target data store also specified in the definition of the materialized view;
obtain, for at least one of the the one or more data sources, a respective one or more changes made at the at least one data source;
determine a new version of the materialized view that satisfies the definition of the materialized view from the respective one or more changes obtained from the at least one data source; and
send one or more requests to update an existing version of the materialized view stored in the target data store to the new version of the materialized view via an interface for the target data store.


US Pat. No. 11,113,272

METHOD AND APPARATUS FOR STORING BLOCKCHAIN STATE DATA AND ELECTRONIC DEVICE

Advanced New Technologies...


1. A computer-implemented method of storing blockchain state data, comprising:after execution of a transaction in a target block in a blockchain is completed, based on a latest account state of a target account related to the transaction after execution of the transaction, modifying and updating, by a blockchain node device, data nodes corresponding to the target account on a current Merkle state tree of a previous block adjacent to the target block, to obtain a current Merkle state tree of the target block,
wherein the current Merkle state tree of the target block is formed by latest account states of blockchain accounts of the blockchain;
based on a historical account state of the target account before execution of the transaction, generating, by the blockchain node device, historical data nodes corresponding to a historical Merkle state tree of the target block, wherein the historical Merkle state tree of the target block is formed by historical account states of blockchain accounts of the blockchain; and
based on (i) the generated historical data nodes and (ii) data nodes other than data nodes corresponding to the target account on a historical Merkle state tree of the previous block adjacent to the target block, creating, by the blockchain node device, the historical Merkle state tree of the target block,
wherein the current Merkle state tree of the target block and the historical Merkle state tree of the target block are distinct Merkle state trees and are stored in a database, wherein at least some data stored in the historical Merkle state tree of the target block is blockchain account data not stored in the current Merkle state tree of the target block, wherein the current Merkle state tree of the previous block adjacent to the target block and the historical Merkle state tree of the previous block adjacent to the target block are distinct Merkle state trees and are stored in the database, and wherein at least some data stored in the historical Merkle state tree of the previous block adjacent to the target block is blockchain account data not stored in the current Merkle state tree of the previous block to the target block.

US Pat. No. 11,113,270

STORING A NON-ORDERED ASSOCIATIVE ARRAY OF PAIRS USING AN APPEND-ONLY STORAGE MEDIUM

EMC IP HOLDING COMPANY LL...


1. A method, comprising:receiving, by a system comprising a processor, an update request comprising a table key and value corresponding to a table segment implemented in an append-only storage medium;
appending, by the system, the update request to the table segment by serializing the update request at an offset location in the table segment;
updating, by the system, a memory key index that is stored in memory with the offset location corresponding to the update request;
asynchronously indexing, by the system, the memory key index to an attribute index stored in an extended append-only storage medium;
receiving, by the system, a read request comprising the table key, the read request being for a requested value paired with the table key;
in response to the receiving the read request, looking, by the system, for the requested value in the memory key index using the table key; and
in response to the requested value being determined not to be present in the memory key index, using, by the system, a hash of the table key to access the attribute index to obtain the offset location in the table segment corresponding to the offset location from which the requested value is able to be obtained.

US Pat. No. 11,113,269

SYSTEMS AND METHODS FOR APPLICATION DATA SERVERS

Appian Corporation, McLe...


1. A non-transitory computer readable medium including instructions that, when executed by at least one processor, cause the at least one processor to perform operations for automatic and efficient updating of a database, the operations comprising:generating, through a machine learning process, an identification of a task of an application associated with the database, wherein the machine learning process includes monitoring activity of the application involving the database;
determining patterns of the application's access to data stored in the database;
providing the identified task and the determined patterns of the application to a feedback loop;
identifying changes in the application's access to data stored in the database from the feedback loop; and
automatically updating a schema of the database based on the identified changes in the application's access to data stored in the database from the feedback loop.

US Pat. No. 11,113,268

METHOD AND DEVICE FOR RESTORING MISSING OPERATIONAL DATA

PUSAN NATIONAL UNIVERSITY...


1. A method for restoring missing operational data, the method comprising:determining which one of three locations missing data is identified in, wherein the three locations are 1) a first event in a header area of operational data, 2) a first resource in the body area of the operational data, and 3) both the first event and the first resource, wherein the first even is activity using the first resource;
determining which one of four forms related to number of the first resource and the first event, wherein the four forms are 1) a form in which the first resource is provided in singular and the first event is provided in singular, 2) a form in which the first resource is provided in singular and the first event is provided in plural, 3) a form in which the first resource is provided in plural and the first event is provided in singular, and 4) a form in which the first resource is provided in plural and the first event is provided in plural;
extracting candidate data from a missing table, depending on a combination of 1) the determined form of the four forms related to the number of the first resource and the first event and 2) the determined location where the missing data is identified; and
processing the candidate data to restore the missing data, based on at least one restoration scheme selected from three restoration schemes, wherein the three restoration schemes are 1) a scheme of comparing one or more events or one or more resources in operational data and non-missing operational data one-to-one and assigning scores depending on a degree of coincidence to determine candidate data to be restored, 2) a scheme for determining the candidate data to be restored through an event chain according to an order in which unit events are arranged, and 3) a scheme for determining the candidate data to be restored through a solution set composed of unit resources,
wherein the at least one restoration scheme is selected based on the combination of 1) the determined form of the four forms related to the number of the first resource and the first event and 2) the determined location where the missing data is identified.

US Pat. No. 11,113,267

ENFORCING PATH CONSISTENCY IN GRAPH DATABASE PATH QUERY EVALUATION

Microsoft Technology Lice...


1. A method, comprising:executing one or more processes for storing a graph in a base version of a graph database, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates; and
when a query of the graph database is received, using one or more of the one or more processes to process the query by:storing intermediate results of the query in a structure comprising rows in a set of tables and links between pairs of rows in different tables in the set of tables;
tracking, in the structure, representations of data, relationships, and path consistency in the query;
applying one or more operations to existing rows in the structure to generate a final result of the query; and
providing the final result in a response to the query.


US Pat. No. 11,113,266

DETECTING INCONSISTENCIES IN SEMANTICS OF BUSINESS VOCABULARY AND BUSINESS RULES (SBVR) USING MANY-SORTED LOGIC

Tata Consultancy Services...


1. A method for detecting inconsistencies in Semantics of Business Vocabulary and Business Rules (SBVR) using Many-Sorted Logic, the method comprising:defining, by one or more hardware processors, a set of rules expressed in SBVR, wherein the set of rules comprises syntactic and semantic ambiguities and inconsistencies, and wherein each of the set of rules facilitate one or more actions based upon a specification of one or more conditions;
translating, via the one or more hardware processors, the set of SBVR rules into a SBVR eXtensible Markup Language Metadata Interchange (XMI) comprising segregated SBVR vocabulary and rules, wherein the translating is performed by implementing a clustering technique on the set of SBVR rules, wherein the translating comprises generating a plurality of graphical clusters for the segregated SBVR vocabulary to schematically represent an inheritance in the segregated SBVR vocabulary;
transforming the SBVR XMI into one or more Satisfiability Modulo Theories Library (SMT-LIB) formulas using at least one logical structure and semantic of Many-Sorted Logic, wherein the transforming comprises a mapping of each of the segregated SBVR rules into a corresponding SMT-LIB representation using one or more axioms, for capturing a set of existing information in each of the segregated SBVR rules; and
detecting, from the one or more SMT-LIB formulas, one or more inconsistencies in semantics of SBVR by using a Satisfiability Modulo Theories (SMT) solver invocation,
wherein:the step of detecting the one or more inconsistencies comprises extracting, by implementing a Mapping Regions of Constraint sets (MARCO) technique, all minimally unsatisfiable sub-formulas from the one or more SMT-LIB formulas, and wherein the minimally unsatisfiable sub-formulas are minimal set of rules in the one or more SMT-LIB formulas inconsistent with each other; and
the step of extracting all the minimally unsatisfiable sub-formulas facilitate a simultaneous detection of the one or more inconsistencies from the one or more SMT-LIB formulas.


US Pat. No. 11,113,265

INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING SYSTEM

FUJITSU LIMITED, Kawasak...


1. An information processing apparatus comprising:a memory configured to store therein a first code generated from first data structure information, the first data structure information indicating columns of a table stored in a relational database; and
a processor configured to add into the memory a second code generated from second data structure information indicating the columns after update without deleting the first code when the update satisfies a prescribed condition, to obtain a request message including information on at least one target column of the table and a third code and requesting a data read or write operation on the table, to compare first second code with the third code, to permit the requested data read or write operation by skipping an exception process upon determining that the second code and the third code are identical, to compare the first code with the third code upon determining that the second code and the third code are different, to permit the requested data read or write operation by skipping the exception process upon determining that the first code and the third code are identical, and to perform the exception process upon determining that the first code and the third code are different, the exception process including checking for consistency between the second data structure information and the information on the at least one target column.

US Pat. No. 11,113,264

CONFLICT RESOLUTION FOR DATABASE FILE MERGE

SAP SE, Walldorf (DE)


1. A computing system comprising:a processor configured toreceive a request to publish a modified version of a database file modified by a user having privileges to update the database file,
detect a conflict between one or more data values of hierarchical data included in a table of the unpublished modified version of the database file and one or more corresponding data values of corresponding hierarchical data in an intervening version of the database file published at the database by another user that also has privileges to update the database file,
determine a suggested aggregation layer of the one or more conflicting data values within different aggregation layers of the hierarchical data included in the table based on an amount of conflicts within suggested aggregation layer, wherein a column of conflicting data values in the suggested aggregation layer of the table encompasses an aggregate of all conflicting data values from among a plurality of columns of conflicting data values within a next lowest aggregation layer of the table, and

output a user interface displaying an identification of the one or more conflicting data values in the suggested aggregation layer and one or more selections for automatically resolving the one or more conflicting data values at the database.

US Pat. No. 11,113,263

VARIATIONS RECOGNITION BETWEEN HETEROGENEOUS COMPUTER SYSTEMS

eAffirm LLC, Austin, TX ...


1. A computer that is configured to communicate with a server and a smartphone, the computer including:a computer-accessible medium to exchange information in a predetermined architecture of interchange of a plurality of device-independent documents between a plurality of heterogeneous computer systems, the computer-accessible medium comprising:
a data capture module that receives an integrated device-independent document and extracts data from the integrated device-independent document, generating extracted data;
an external question module that receives the extracted data from the data capture module and generates one or more queries that are encapsulated in a corresponding number of enquiry/inquiry transmissions, the enquiry/inquiry transmissions being short-message-service text messages;
a communication subsystem that receives the enquiry/inquiry transmissions and that includes an external engagement system that transmits the enquiry/inquiry transmissions to the smartphone that is associated with a subscriber in the enquiry/inquiry transmissions and receives an acknowledgement transmission or a negative-acknowledgement transmission from the smartphone, an acknowledgement/negative-acknowledgement transmission including the acknowledgement transmission or the negative-acknowledgement transmission, the acknowledgement/negative-acknowledgement transmission being a short-message-service text message, and the communication subsystem also stores the acknowledgement/negative-acknowledgement transmission in an external interaction database,
wherein the acknowledgement transmission further comprises a single character message indicating acknowledgement of a corresponding enquiry/inquiry transmission,
a variance analytic module that includes a server that includes a location specific service component associated with a plurality of healthcare providers that retrieves the acknowledgement/negative-acknowledgement transmission from the external interaction database and that generates a quantitative variance from the acknowledgement/negative-acknowledgement transmission, the quantitative variance describing statistical variances and discrepancies within the integrated device-independent document, wherein the quantitative variance is generated by analyzing discrepancies that are at or above a predetermined threshold that are identified in the extracted data between a CPT code, a performance time of a procedure of the CPT code, a priority code, a sequence code in the acknowledgement/negative-acknowledgement transmission, and from a previous response and between a CPT code, a performance time of a procedure of the CPT code, a priority code, a sequence code in the acknowledgement/negative-acknowledgement transmission in the extracted data, in reference to a response rule table of the external interaction database.

US Pat. No. 11,113,262

TIME-EFFICIENT LOCK RELEASE IN DATABASE SYSTEMS

SAP SE, Walldorf (DE)


1. A computer-implemented method for releasing transaction locks in constant time for transactions executed in database systems, the method comprising:executing, within a database system, a first transaction on resources in the database system;
in response to executing the first transaction, establishing a first set of locks, each lock corresponding to a resource the first transaction is executed on and each lock prohibiting accesses from other transactions to the respective resource within the database system;
associating the first transaction with a first transaction control block (TCB) index of a transaction control table, each entry of the transaction control table comprising a transaction control index associated with a respective transaction, a transaction status and a lock status of the respective transaction;
setting, within the transaction control table, the transaction status of the first transaction to active in response to executing the first transaction and the lock status of the first transaction to holding in response to the first set of locks being established for the first transaction;
providing a lock table that records, for a set of locks within the database system, a set of lock owners comprising one or more transactions identified based on respective TCB indexes and a wait queue;
determining that the first transaction has completed, and in response setting the transaction status of the first transaction to indicate completion of the transaction and the lock status of the first transaction to released; and
releasing the first set of locks in response to the setting of the lock status of the first transaction to released.

US Pat. No. 11,113,261

DATA LOCKING

SAP SE, Walldorf (DE)


1. A computer-implemented method to query a dataset, the method comprising:receiving, by a processor, a query to be executed against a dataset, the dataset comprising database data tables including a fixed plurality of dimensions each having a fixed plurality of members and a locks table specifying one of a fixed plurality of lock states for the plurality of members, the fixed plurality of members each having an associated index value defined by a database index table for each of the plurality of dimensions, and the query specifying a combination of at least two of the members;
determining, by the processor, the associated index value for each of the members specified in the query based on an index table defined for each dimension;
determining, by the processor and based on a combination of values for the indices associated with the members specified in the query, a lock state specified in the locks table for the combination of the at least two members specified in the query;
generating a query result based on the lock state for the combination of the at least two members specified in the query; and
storing a record of the query result in a memory.

US Pat. No. 11,113,260

TRANSACTIONAL ACCESS TO RECORDS ON SECONDARY STORAGE IN AN IN-MEMORY DATABASE

Microsoft Technology Lice...


1. A computing system, comprising:a processor;
memory that comprises a primary storage, the primary storage comprises a first subset of records of a database, the database being an in-memory database; and
a data store that comprises secondary storage, the secondary storage comprises a second subset of the records of the database;
the memory further comprises:an access filter that comprises a summary of contents of at least a portion of the secondary storage;
a private cache for a transaction; and
a database management system that is executable by the processor, the database management system processes the transaction, the database management system further comprises:a storage interface that:checks the access filter in the memory to identify whether to access the secondary storage for a record;
responsive to the access filter indicating to access the secondary storage for the record, retrieves the record from the secondary storage; and
inserts the record into the private cache for the transaction.




US Pat. No. 11,113,259

METHOD AND SYSTEM FOR ANALYZING UNSTRUCTURED DATA FOR COMPLIANCE ENFORCEMENT

Tata Consultancy Services...


1. A processor implemented method for analyzing unstructured data for compliance enforcement, the method comprising:receiving, by a one or more hardware processors, a transaction request for unstructured data linked to a data subject among a plurality of data subjects registered with an enterprise, wherein the unstructured data comprises a plurality of data fields, wherein the plurality of data fields of the unstructured data is converted into web accessible resources and linked with identity of the plurality of data subjects, and wherein each data field among the plurality of data fields is identified by a unique Uniform Resource Identifier (URI) providing a web view of the unstructured data;
identifying, by the one or more hardware processors, a purpose of the transaction request by analyzing the transaction request using text analytics, wherein the purpose of the transaction request is identified to enforce purpose-based processing of data linked to the data subject in all enterprise operations, such that the processing of data linked to the data subject is in compliance with data protection and privacy regulations;
identifying, by the one or more hardware processors, data-of-interest for the identified purpose from the unstructured data linked to the data subject, wherein the data-of-interest corresponds to a set of data fields among the plurality of data fields of the unstructured data;
identifying, by the one or more hardware processors, a plurality of sensitive fields among the set of data fields corresponding to the identified data-of-interest using text analytics, wherein each sensitive field among the plurality of sensitive fields is associated with a data subject preference, preset by the data subject; and
processing the transaction request, by the one or more hardware processors, for the set of data fields corresponding to the data-of-interest in accordance with the data subject preference for each sensitive field in the data-of-interest, wherein the set of data fields are accessed using corresponding unique URI.

US Pat. No. 11,113,258

ARTIFICIALLY-INTELLIGENT, CONTINUOUSLY-UPDATING, CENTRALIZED-DATABASE-IDENTIFIER REPOSITORY SYSTEM

Bank of America Corporati...


1. A method for data consolidation of an artificially-intelligent centralized key data repository, the method comprising:reviewing a plurality of databases, each database included in the plurality of databases comprising one or more tables;
based on the reviewing, determining:duplicate records within the plurality of databases;
comparable records within the plurality of databases;
a utilization metric for each table included within the plurality of databases;

ranking the tables included in the plurality of databases based on the utilization metric, wherein more frequently used tables receive higher ranking and less frequently used tables receive lower ranking;
determining and assigning memory locations for each table, the memory locations including a plurality of memory locations with shorter than a threshold response time and a plurality of locations with greater than the threshold response time, wherein tables with greater than a threshold frequency are assigned to memory locations with shorter than the threshold response time and tables with lower than the threshold frequency are assigned to memory locations with greater than the threshold response time;
identifying one or more recommendations for database synchronization and/or database usage optimization;
displaying the recommendations to operator; and
executing the recommendations upon receipt of operator confirmation.

US Pat. No. 11,113,257

SYSTEM AND METHOD OF MANAGING KEY ENTITY RECORDS

Innoplexus AG, Eschborn ...


1. A system that manages key entity records required by a user, wherein the system comprises:a database arrangement operable to store a structured database comprising entity records; and
a computer system comprising a memory and a processor communicably coupled to the database arrangement, the processor being operable to:receive the structured database comprising entity records, wherein each of the entity records comprises an entity name and plurality of entity attributes, further wherein the plurality of entity attributes belong to asset classes;
determine an importance score for each of the entity records, wherein the importance score for a given entity record is determined based upon the plurality of entity attributes thereof, further wherein each of the asset classes comprising the plurality of entity attributes of the given entity record has a corresponding predefined contribution metric towards the importance score of the given entity record;
identify key entity records based on the determined importance scores of the entity records;
receive a tuning-input from the user, wherein the tuning-input is operable to adjust at least one of the contribution metrics corresponding to the asset classes;
calculate a tuned importance score for each of the entity records based on the tuning-input from the user; and
identify the key entity records required by the user based on the tuned importance scores of the entity records;


wherein the processor is further operable to develop the structured database by:crawling existing data sources to extract data-records;
structuring the extracted data-records to obtain entity records, wherein each of the entity records comprises an entity name and plurality of entity attributes;
tagging each of the plurality of entity attributes with one of the asset classes; and
identifying a field of each of the entity records based on at least one of the plurality of entity attributes of the entity record.

US Pat. No. 11,113,256

AUTOMATED DATA DISCOVERY WITH EXTERNAL KNOWLEDGE BASES

salesforce.com, inc., Sa...


1. A computing system, comprising:a processing device; and
a memory device coupled to the processing device, the memory device having instructions stored thereon that, in response to execution by the processing device, cause the processing device to:receive a request to analyze a data set stored in the memory device, the data set including one or more columns, the one or more columns including one or more data values in one or more cells of each column;
classify each of the one or more columns as a type of column;
for a selected one of the one or more columns, if the selected column's type is an external type, join one or more columns of an external knowledge base correlated to the selected column into the data set to create an expanded data set;
execute an automated data discovery model on the expanded data set to automatically determine insights from the expanded data set not discoverable by executing the automated data discovery model on the data set; and
train the automated data discovery model on the expanded data set.


US Pat. No. 11,113,255

COMPUTER-BASED SYSTEMS CONFIGURED FOR ENTITY RESOLUTION FOR EFFICIENT DATASET REDUCTION

Capital One Services, LLC...


1. A method comprising:accessing, by at least one processor, a plurality of entity records in at least one database;wherein the plurality of entity records are associated with a plurality of entities;
wherein each entity record of the plurality of entity records comprises entity data representing identifying information;

blocking, by the at least one processor, the plurality of entity records using at least one blocking technique to produce blocks of entity records based on a similarity measure between pairs of entity records of the plurality of entity records;
generating, by the at least one processor, candidate pairs based at least in part on the blocks of entity records;
generating, by the at least one processor, a match score for each candidate pair based at least in a part on the blocking between each entity record of each candidate pair;
determining, by the at least one processor, a matching pair for each entity record comprising a matching entity record associated with each entity record based at least in part on a particular candidate pair of each candidate pair associated with each entity having a highest match score of the candidate pairs associated with each entity record;
determining, by the at least one processor, at least one cluster of duplicated entity records based on a grouping of each matching pair having a common entity record;wherein the matching entity record associated with each entity record in each cluster of entity records is associated with at least one other entity record in each cluster of entity records;

merging, by the at least one processor, records of each cluster of entity records of the at least one cluster of entity records to form at least one merged entity record to reduce duplication of data in the database;
determining, by the at least one processor, an entity associated with each merged entity record of the at least one merged entity record; and
deploying, by the at least one processor, the at least one database with the merged entity records in place of each cluster of entity records to reduce resource consumption.

US Pat. No. 11,113,254

SCALING RECORD LINKAGE VIA ELIMINATION OF HIGHLY OVERLAPPED BLOCKS

Amazon Technologies, Inc....


1. A computer-implemented method comprising:obtaining records from a plurality of data sources based at least on credentials received from a client device;
normalizing the records;
storing the records in a data lake service in a provider network;
determining one or more blocking parameters based at least on the records;
identifying a first plurality of blocks based at least on the records stored in the data lake service using the one or more blocking parameters, each block representing a subset of records sharing at least one blocking key;
identifying a plurality of matching blocks from the first plurality of blocks;
deleting the plurality of matching blocks except for a first block from the plurality of matching blocks;
iteratively performing intersection dynamic blocking based at least on the first block to generate a subsequent plurality of blocks until an end condition is detected;
performing pairwise matching on a plurality of records represented by the subsequent plurality of blocks;
generating a weighted graph of records, wherein each vertex of the graph represents a record from the plurality of records and each edge is weighted based at least on the pairwise matching of the plurality of records; and
identifying a plurality of matching records using a transitive closure clustering algorithm applied to the weighted graph of records.

US Pat. No. 11,113,253

TEMPLATE-BASED SYNCHRONIZED CUSTOMIZATION DEPLOYMENT ON DATABASE SYSTEMS

SAP SE, Walldorf (DE)


1. A method for template-based synchronized deployment in multiple database systems, the method comprising:deploying a first customizable template for a first system, the first customizable template defining database fields for receiving data in a database of the first system, wherein deploying the first customizable template comprises:receiving, from a user device, a request to deploy the first customizable template for the first system;
receiving, from the user device, configuration information for the first customizable template for the first system; and
customizing, based on the received configuration information, the first customizable template for the first system; and

after the first customizable template is deployed, automatically identifying and deploying one or more compatible templates in at least one connected system, wherein the identifying and deploying comprises:
identifying a second, corresponding customizable template of the at least one connected system corresponding to the first customizable template, wherein the at least one connected system comprises equivalent information of the first system but represents the equivalent information differently from the first system, wherein fields in the first system are represented differently in the at least one connected system, wherein differently represented comprises representing a single data field as a plurality of data fields;
transmitting the configuration information from the first system to the identified connected system; and
configuring the second, corresponding customizable template based on the transmitted configuration information, the second, corresponding customizable template defining different database fields for receiving data in related databases of the identified connected system, wherein configuring the second, corresponding customizable template comprises aligning the second, corresponding customizable template with a same or similar customization as applied to the first customizable template and a mapping accounts for the differently represented fields.

US Pat. No. 11,113,252

USER SELECTABLE DATA SOURCE FOR DATA RECOVERY

EMC IP HOLDING COMPANY LL...


1. A method for performing a recovery operation to recover data to a host, the method comprising:initiating a workflow for configuring a recovery operation to restore a backup, the workflow including a plurality of elements, wherein the plurality of elements relate to recovery operations that are common to workflows for different hosts;
dynamically adapting the workflow, by a recovery module that is selected based on a manner in which data of the host was backed up, to account for a specific circumstance of the host and of data associated with the host by adding an element to the workflow, changing one of the plurality of elements in the workflow, and/or removing one of the plurality of elements from the workflow;
adapting the workflow to include multiple media pools, wherein a copy of the backup is stored in each of the media pools;
receiving input into the dynamically adapted workflow that is displayed in a user interface on a display, wherein the input includes a selection of a particular media pool from the multiple media pools; and
recovering the data of the host from the backup in accordance with the workflow from a backup stored at the particular media pool.

US Pat. No. 11,113,251

TRANSACTION MANAGER

Vast Data Ltd., Tel Aviv...


1. A system for transaction management, comprising:a processing circuitry; and
a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to:
assign a transaction identifier (ID) to a transaction, wherein the transaction includes at least one modification to at least one object stored in a storage system;
update a state of the transaction to indicate that the transaction is in progress;
add at least one conditional entry to each object of the at least one object that is expected to be affected by the transaction, wherein each conditional entry identifies at least one modification that is expected to be applied on the object by the transaction;
in response to a subsequent read request addressed to a certain object of the at least one object, identify that a first conditional entry exists for the certain object, wherein the first conditional entry is associated with the transaction, and determine a current state of the transaction;
respond to the subsequent read request based on the first conditional entry, and the current state of the transaction; and
update the state of the transaction when a termination event occurs.

US Pat. No. 11,113,250

TECHNIQUES FOR ACTIVITY TRACKING, DATA CLASSIFICATION, AND IN DATABASE ARCHIVING

Oracle International Corp...


1. A method comprising:a database management system (DBMS), in response to receiving a database command that accesses one or more database elements of a database, determining one or more activities that the database command performs;
the DBMS marking the one or more database elements in one or more bitmaps respectively corresponding to the one or more activities;
the DBMS, in response to a determination that a specified period of time has elapsed, adding the one or more bitmaps to a bitmap log.

US Pat. No. 11,113,249

MULTITENANT APPLICATION SERVER USING A UNION FILE SYSTEM

SAP SE, Walldorf (DE)


1. A method comprising:receiving, at a multitenant application server and via a network, a first request from a first user device associated with a first user identifier of a tenant to share an application defined using a file stored in a first layer of a union file system of a storage device, the first layer corresponding to the first user identifier;
in response to the first request, moving, by one or more hardware processors, the file from the first layer to a second layer of the union file system of the storage device, the second layer corresponding to the tenant; and
based on the file being on the second layer of the union file system and a second user device being associated with a second user identifier of the tenant, providing access to the application to the second user device.

US Pat. No. 11,113,248

GENERATING AND SHARING METADATA FOR INDEXING SYNCHRONIZED CONTENT ITEMS

Dropbox, Inc., San Franc...


1. A computer-implemented method for generating and sharing metadata for indexing a synchronized content item, the method, performed at a server system comprising one or more processors, the computer-implemented method comprising:the server system storing a content item that is synchronized between the server system and a first battery-operated client device, the content item hosted with a content management service that operates the server system, the first battery-operated client device associated with a first user account held with the content management service;
based on receiving via data network a modification to the content item from the first battery-operated client device, the server system automatically generating a keyword metadata for indexing the content item, as modified, according to a metadata generation rule and based on parsing the content item, as modified;
according to a metadata sharing rule, the server system automatically sending via a data network the keyword metadata to a second client device that is not the first battery-operated client device, the second client device associated with a second user account held with the content management service that is not the first user account, the server system automatically sending the keyword metadata to the second client device responsive to receiving a request from the second client device of an acceptance of a request to share the content item with the second user account, the request to share the content item associated with the first user account; and
wherein the server system automatically sending the keyword metadata to the second client device causes the content item, as modified, to be indexed in an inverted file index at the second client device by the keyword metadata.

US Pat. No. 11,113,247

ROUTING I/O REQUESTS TO IMPROVE READ/WRITE CONCURRENCY

Veritas Technologies LLC,...


1. A system comprising:a memory; and
one or more processors coupled to the memory; and
circuitry, wherein the circuitry is configured to:receive a plurality of requests targeting a single file stored in an extent-based file system;
identify a plurality of extent maps that correspond to the single file;
determine which extent map of the plurality of extent maps to use for routing each of the plurality of requests, based on one or more characteristics of each of the plurality of requests;
route a given request of the plurality of requests to a first extent map, responsive to determining a size of the given request is greater than a first threshold;
route the given request to a second extent map different from the first extent map responsive to determining a size of the given request is less than the first threshold;
access the first extent map as an initial map used to identify first physical storage locations storing actual data corresponding to the first extent; and
access the second extent map, simultaneous with the access of the first extent map, as an initial map used to identify second physical storage locations storing actual data corresponding to the second extent.


US Pat. No. 11,113,246

ACCESSING A FILE SYSTEM USING TIERED DEDUPLICATION

Commvault Systems, Inc., ...


1. A method comprising:executing a data agent associated with a virtual machine, wherein the data agent is a component of a storage management system;
executing a pseudo-file-system driver that instantiates a file system based on exposing a first mount point for the file system,wherein the file system resides in a primary storage resource in communication with the virtual machine;

associating, by the pseudo-file-system driver, the file system with a deduplication database component of the storage management system;
executing the virtual machine with access to the file system;
invoking by the pseudo-file system driver at least one deduplication job, which:(i) moves some data from the file system in the primary storage resource to a secondary storage resource, and
(ii) stores the moved data in deduplicated form in the secondary storage resource based at least in part on the deduplication database associated with the file system; and

wherein, based on the at least one deduplication job, the pseudo-file-system driver provides the virtual machine with access to the file system configured without a storage-capacity limit; and
wherein the virtual machine, the data agent, and the pseudo-file-system driver execute in a cloud services environment, and further wherein at least one of the primary storage resource and the secondary storage resource is configured in the cloud services environment.

US Pat. No. 11,113,245

POLICY-BASED, MULTI-SCHEME DATA REDUCTION FOR COMPUTER MEMORY

INTERNATIONAL BUSINESS MA...


1. A computer-implemented method for policy-based, multi-scheme data reduction in a computer memory, the method comprising:receiving, by a policy engine of the computer memory, a plurality of policy rules comprising a first policy rule that specifies applying a first data reduction scheme to data in the computer memory that matches first characteristics and a second policy rule that specifies applying a second data reduction scheme to data in the computer memory that matches second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme;
determining, by the policy engine, that first data in the computer memory matches the first characteristics;
determining, by the policy engine, that second data in the computer memory matches the second characteristics;
applying the first data reduction scheme to the first data;
modifying a metadata block corresponding to the first data and the second data to indicate that the first data reduction scheme was applied to the first data;
applying the second data reduction scheme to the second data; and
modifying the metadata block to indicate that the second data reduction scheme was applied to the second data.

US Pat. No. 11,113,244

INTEGRATED DATA PIPELINE

A9.COM, INC., Palo Alto,...


1. A computer-implemented method, comprising:receiving, from one or more data sources, event data for each of a plurality of events;
determining a maximum file size of the event data that is to be aggregated and compressed into each data block in a set of data blocks, wherein the maximum file size is determined as fixed or variable based at least in part on current workload or resource capacity;
aggregating, using at least two concurrently executing threads, the event data into the set of data blocks of up to a maximum file size;
compressing the data blocks using a block-based compression algorithm;
causing the data blocks to be transmitted asynchronously to a processing service, the data blocks being transmitted by a streaming service configured to provide multiple concurrent data streams for transmission of the data files;
allocating, by the processing service, one or more worker resources for performing tasks relating to the data blocks;
decompressing the data blocks to obtain individual data records for the plurality of events;
determining an event type for a specified record of individual data records, the event type being one of a bid, impression, or click;
determining at least one of online processing or offline processing to be performed for the specified record based at least in part upon the event type;
extracting, when the online processing is to be performed for the specified record, a specified set of data from the specified record and providing the specified set of data for the online processing; and
providing, when the offline processing is to be performed for the specified record, a set of batched files of sequentially concatenated records from the individual data records to be stored for subsequent offline processing.

US Pat. No. 11,113,243

METHODS AND APPARATUS FOR SELECTIVE CAPTURE OF MAINFRAME OPERATING SYSTEM RECORDS

SYNCSORT INCORPORATED, P...


1. A method comprising:receiving, at a compute device, a collected set of system measurement facility (SMF) data, the collected set of SMF data associated with a mainframe operating system, the collected set of SMF data received at a rate that, on aggregate, the SMF data is produced by the mainframe operating system, each record from the collected set of SMF data having a record-type identifier and containing a plurality of SMF field values, each SMF field value from the plurality of SMF field values associated with a SMF field-type identifier;
retrieving from a memory operatively coupled to the compute device, a set of SMF field-type identifiers, each SMF field-type identifier from the set of SMF field-type identifiers having a one-to-one logical relation with a conditional value from a set of conditional values such that each conditional value from the set of conditional values identifies, by SMF field-type identifier, records to be flattened;
selecting a set of SMF field values from each record from the collected set of SMF data associated with a SMF field-type identifier that the set of conditional values indicate are to be flattened;
executing, for each SMF field value from the set of SMF field values, a flattening data structure linked to a SMF field-type identifier over the set of SMF field values to produce a flattened record that includes at least one flattened SMF field value converted into a target format; and
inserting the flattened record into a data repository compatible with the target format.

US Pat. No. 11,113,242

PROGRAMMATICALLY CHOOSING PREFERRED STORAGE PARAMETERS FOR FILES IN LARGE-SCALE DISTRIBUTED STORAGE SYSTEMS

Google LLC, Mountain Vie...


1. A method comprising:identifying, by a processor, a subset of files within a distributed storage system;
receiving, by the processor, initial trace data indicating initial access patterns of the subset of files within the distributed storage system;
determining, by the processor, based on the initial access patterns, an initial storage parameter for the subset of files within the distributed storage system, the initial storage parameter affecting a cost associated with storing the subset of files;
receiving, by the processor, updated trace data indicating updated access patterns of the subset of files within the distributed storage system;
determining, by the processor, based on the updated access patterns, an updated storage parameter for the subset of files within the distributed storage system, the updated storage parameter reducing the cost associated with storing the subset of files; and
in response to determining the updated storage parameter, generating, by the processor, an alert for a user of the distributed storage system, the alert for the user comprising the updated trace data and the updated storage parameter reducing the cost associated with storing the subset of files.

US Pat. No. 11,113,241

COMPUTER APPLICATION FOR BLOCKCHAINING FILES THROUGH A GRAPHICAL USER INTERFACE


1. A non-transitory computer medium containing instructions for a method of creating blockchains that have files as data using a computer application, comprising:displaying one or more virtual blockchain blocks on a Graphical User Interface (GUI);
applying rules to the one or more virtual blockchain blocks that prevent files from being associated to specified virtual blockchain blocks based on file criteria;
associating files with the one or more virtual blockchain blocks through selecting a file from a file manager and identifying one of several virtual blockchain blocks to which the selected file is to be associated with through the use of a Graphical User Interface (GUI) pointing device and then adding metadata identifying the selected file to the one identified virtual blockchain block; and
converting the one identified virtual blockchain block to an actual new blockchain block added to a blockchain by accessing the selected file using the metadata from the one identified virtual blockchain block and creating a blockchain hash based on the selected file and a previous blockchain block, wherein the actual new blockchain block includes the blockchain hash and the selected file as data.

US Pat. No. 11,113,240

METHODS AND SYSTEMS FOR DEPICTION OF PROJECT DATA VIA TRANSMOGRIFICATION USING FRACTAL-BASED STRUCTURES

Peter Antony Gish, Hanov...


1. A method for efficiently organizing, storing, searching, accessing, and analyzing project data and for visualizing project progress, the method comprising steps of:selecting for a specified project, a reference fractal-based structure based on, at least in part: (i) type of the specified project and (ii) a mapping between project types and reference fractal-based structures;
organizing and storing by a processor a plurality of project files in a file structure corresponding to the selected reference fractal-based structure;
transmogrifying by the processor the file structure into a digitally produced viewable fractal-based structure; and
displaying by the processor the viewable fractal-based structure.

US Pat. No. 11,113,239

METHOD AND SYSTEM FOR PROVIDING PRE-APPROVED A/A DATA BUCKETS

Verizon Media Inc., New ...


1. A method for providing pre-validated data buckets for online experiments, the method being implemented on at least one machine comprising at least one processor, memory, and communications circuitry, and the method comprising:obtaining user activity data representing user activities of a plurality of users having a first plurality of respective user identifiers;
hashing each of the first plurality of user identifiers to obtain a plurality of hash values;
generating a set of metric values representing a user engagement metric for each hash value of the plurality of hash values based on the user activity data;
ranking the plurality of hash values based on the set of metric values to obtain a ranked list of hash values;
determining a range of hash values to be removed from the plurality of hash values based on one or more exclusion rules and the ranked list of hash values; and
generating a homogenous value set by removing the range of hash values from the plurality of hash values, wherein each hash value from the homogenous value set corresponds to one or more user identifiers from the plurality of user identifiers that are permitted to be placed in a data bucket for an online experiment.

US Pat. No. 11,113,238

METHODS AND SYSTEMS FOR METADATA TAG INHERITANCE BETWEEN MULTIPLE STORAGE SYSTEMS

International Business Ma...


1. A computer-executed method comprising:maintaining a plurality of data storage systems for storing electronic data, each of the plurality of data storage systems having one or more processors having circuits and logic for processing information and performing logic operations;
maintaining an external metadata management system separate from and in communication with the plurality of data storage systems, wherein the metadata management system has one or more processors having circuitry and logic for processing information and performing logic operations;
operating the metadata management system to collect and store metadata corresponding to all the electronic data residing on the plurality of data storage systems as a plurality of metadata entries in the metadata management system, wherein each of the plurality of metadata entries in the metadata management system comprises metadata, wherein operating the metadata management system comprises applying one or more custom metadata tags by the metadata management system to each metadata entry in the metadata system, wherein applying the one or more custom metadata tags to each metadata entry comprises analyzing the metadata in a respective metadata entry to derive the one or more custom metadata tags to apply to the respective metadata entry, and the one or more custom metadata tags are associated with and related to the metadata in the metadata entry;
detecting execution of a data operation command on a data set of the electronic data residing in at least one data storage system of the plurality of data storage systems that causes movement of the data set from the at least one data storage system to a destination data storage system that is different from the at least one data storage system, wherein the destination data storage system has one or more processors having circuitry and logic for processing information and performing logic operations; and
in response to detecting the execution of the data operation command, creating, by the metadata management system, a new metadata entry in the metadata management system corresponding to the execution of the data operation command, wherein the new metadata entry includes applying at least one custom metadata tag to the new metadata entry before execution of the data operation command.

US Pat. No. 11,113,237

SOLID STATE CACHE INDEX FOR A DEDUPLICATE STORAGE SYSTEM

EMC IP HOLDING COMPANY LL...


1. A method for creating a fingerprint to container index on a deduplicated storage system, the method comprising:receiving a logical container comprising a fingerprint and a data segment associated with the fingerprint, wherein the container has a container identifier, wherein the fingerprint was generated by hashing at least a portion of the data segment using a first hash function;
applying a hashing process to the fingerprint comprising hashing the fingerprint using a second hash function different from the first hash function, wherein the hashing process maps the fingerprint to a hash bucket of an in-memory hash table;
storing the fingerprint and the container identifier in the hash bucket;
writing the in-memory hash table to a hard drive (“HDD”);
writing the in-memory hash table to a solid state drive (“SSD”), comprising merging the in-memory hash table into a first Index file on the SSD at predetermined time intervals, comprising inserting the fingerprint and the container identifier into the first index file on the SSD; and
merging the first Index file on the SSD into a full index file on the SSD when the first index file reaches a file size limit, comprising inserting the fingerprint, and the container identifier into the full index tile on the SSD and removing the fingerprint and the container identifier from the first index file on the SSD.

US Pat. No. 11,113,236

METHOD FOR AUTOMATIC PROCESSING OF A NUMBER OF PROTOCOL FILES OF AN AUTOMATION SYSTEM

SIEMENS AKTIENGESELLSCHAF...


1. A method for automatically processing a number of generated log files of different types of an automation system in a technical plant, comprising:monitoring and controlling the technical plant with the automation system,
identifying, with agent-based software implemented in a component of the automation system, a number of relevant log files of different types from the number of generated log files of the automation system based on at least one log parameter, wherein the relevant log files comprise at least one of measured signals and status signals from individual components of the technical plant;
transforming, with the agent-based software, the identified relevant log files of different types into relevant standardized log files of a same type;
processing and analyzing, with the agent-based software, data sets of the relevant standardized log files of the same type; and
outputting, with the agent-based software, the data sets of the relevant standardized log files in order to monitor and control with the automation system the individual components of the technical plant.

US Pat. No. 11,113,235

METHODS AND APPARATUS FOR MANAGING OBJECTS IN A STORAGE ENVIRONMENT

EMC IP Holding Company, L...


1. A method of accessing a content unit stored in a storage environment that includes a plurality of storage clusters, wherein the content unit is stored on at least two of the plurality of storage clusters, the method comprising acts of:receiving a request, from a host computer, to read the content unit, the request identifying the content unit via an object identifier assigned to the content unit;
causing each of the plurality of storage clusters to perform a search for the content unit;
determining, based on the searches performed for the plurality of storage clusters, whether a copy of the content unit to be read is stored on multiple clusters;
receiving, from each of the plurality of storage clusters that stores the content unit, a validity indicator for the content unit;
determining, based on the validity indicators, which one of the plurality of storage clusters that stores the content unit stores a valid version of the content unit; and
returning the valid version of the content unit in response to the request.

US Pat. No. 11,113,234

SEMANTIC EXTRACTION METHOD AND APPARATUS FOR NATURAL LANGUAGE, AND COMPUTER STORAGE MEDIUM

TENCENT TECHNOLOGY (SHENZ...


1. A semantic extraction method, in a semantic extraction apparatus comprising at least one processor, comprising:querying, by the at least one processor, in a character library based on a single-character granularity, a character of a natural language that is input, to obtain first semantic vectors representing semantic descriptions of the character;
obtaining, by the at least one processor, candidate semantic intentions corresponding to second semantic vectors and weight vectors corresponding to the candidate semantic intentions, wherein the second semantic vectors are obtained by using a neural network and correspond to different permutations and combinations of the first semantic vectors; and
selecting, by the at least one processor, a candidate semantic intention as a final semantic intention of the natural language based on a preset condition, and obtaining key information corresponding to the final semantic intention according to a weight vector corresponding to the final semantic intention.

US Pat. No. 11,113,233

MULTIPLE BUSSES IN A GROUPED SYSTOLIC ARRAY

Amazon Technologies, Inc....


1. A systolic processor comprising:a systolic array of processing elements arranged in rows and columns, each row of the systolic array including a plurality of row-oriented buses;
wherein the systolic array of processing elements is divided into a first sub-array of processing elements and a second sub-array of processing elements, each sub-array of processing elements including one or more consecutive columns of the systolic array, each sub-array of processing elements further including, for each row, an active row-oriented bus and one or more inactive row-oriented busses, each processing element configured to perform a mathematical operation on an input of the active row-oriented bus corresponding to the respective sub-array;
a first shifter element interposed between the first and second sub-arrays, wherein the first shifter element comprises circuitry configured, for each row of the array, to shift a data element transmitted on an inactive bus of the first sub-array to an active bus of the second sub-array;
wherein each processing element is further configured to:perform the mathematical operation on a weight and an input data element, and
provide the weight and the input data element to a subsequent column of the respective sub-array.


US Pat. No. 11,113,232

DISAGGREGATED COMPUTER SYSTEM

SUPER MICRO COMPUTER, INC...


1. A computer system, comprising:a processor located on a first circuit board having a first connector; and
a memory located on a second circuit board having a second connector, wherein
the first circuit board and the second circuit board are horizontally disaggregated from each other;
the first connector is connected to the second connector;
the processor and the memory are configured to communicate with each other based on a differential signaling scheme by switching data above and below a reference voltage level; and
wherein the first connector and the second connector are connected via a serial link, wherein the first connector and the second connector include at least one of the following: a SATA connector, a micro SATA (mSATA) connector, a SATA2 connector a SATA3 connector, a SATA4 connector, a USB connector, a USB 3.0 connector, a SATAe connector, a Thunderbolt 3 connector, a connector in accordance with JEDEC defined technical standard, a Next Generation Form Factor (NGFF) connector and an M.2 connector.

US Pat. No. 11,113,231

METHOD OF PROCESSING IN MEMORY (PIM) USING MEMORY DEVICE AND MEMORY DEVICE PERFORMING THE SAME

Samsung Electronics Co., ...


1. A processing in memory (PIM) method using a memory device, the method comprising:storing m*n multiplicand arrangement bits in m*n memory cells of the memory device by copying and arranging m multiplicand bits of a multiplicand value where m and n are natural numbers greater than zero;
storing m*n multiplier arrangement bits in m*n read-write unit circuits of the memory device corresponding to the m*n memory cells by copying and arranging n multiplier bits of a multiplier value;
selectively sensing fewer than all of the m*n multiplicand arrangement bits stored in the m*n memory cells based on the m*n multiplier arrangement bits stored in the m*n read-write unit circuits, and storing m*n multiplication bits in the m*n read-write unit circuits based on the selectively sensed m*n multiplicand arrangement bits, the m*n multiplication bits corresponding to bitwise multiplied values of the m*n multiplicand arrangement bits and the m*n multiplier arrangement bits; and
determining a multiplication value of the multiplicand value and the multiplier value based on the m*n multiplication bits stored in the m*n read-write unit circuits, wherein:
the selectively sensing the m*n multiplicand arrangement bits and the storing the m*n multiplication bits in the m*n read-write unit circuits comprise:sensing multiplicand arrangement bits from among the m*n multiplicand arrangement bits that correspond to multiplier arrangement bits from among the m*n multiplier arrangement bits having a value of “1” from the m*n memory cells and replacing the multiplier arrangement bits having the value of “1” stored in the m*n read-write unit circuits with the sensed multiplicand arrangement bits; and
maintaining multiplier arrangement bits from among the m*n multiplier arrangement bits having a value of “0” stored in the m*n read-write unit circuits regardless of values of multiplicand arrangement bits from among the m*n multiplicand arrangement bits that correspond to the multiplier arrangement bits having the value of “0”.


US Pat. No. 11,113,230

MEDIA CONTENT PLAYBACK WITH STATE PREDICTION AND CACHING

Spotify AB, Stockholm (S...


1. A method of media content item caching on a media-playback device having a cache storing media content decryption keys, the method comprising:determining whether the media-playback device is in a predetermined state or is likely to enter a predetermined state within a threshold period of time;
selecting one or more of the cached media content decryption keys responsive to determining that the media-playback device is in the predetermined state or is likely to enter the predetermined state within a threshold period of time; and
while the media playback device is determined to be in the predetermined state or is likely to enter the predetermined state within the threshold period of time, preventing the selected one or more of the cached media content decryption keys from being removed from the cache.

US Pat. No. 11,113,229

PROVIDING A CONTINUATION POINT FOR A USER TO RECOMMENCE CONSUMING CONTENT

International Business Ma...


1. A computer-implemented method for managing consumption of media data, the method comprising:identifying a pause point during consumption of media data at which a user stops the consumption of the media data;
determining a portion of content that precedes the identified pause point, wherein the portion is determined based on at least one of a user preference and a factor regarding the consumption of the media data by the user;
analyzing the portion of content by using natural language processing techniques regarding interrelations between words of the portion of content to identify changes in content concepts in the portion of content, wherein the analyzing includes determining a respective rank of each of the changes that corresponds to how large each respective change is compared to others of the changes;
identifying one or more continuation points for the user to return to the content based on how changes in the content concepts in the portion of content as indicated by respective ranks of each of the changes correspond to one or more factors that identify how the user prefers to reconsume the media data; and
indicating the one or more continuation points to the user.

US Pat. No. 11,113,228

PORTABLE COMPUTING SYSTEM AND PORTABLE COMPUTER FOR USE WITH SAME

Arnouse Digital Devices C...


1. An apparatus, comprising:a portable computer having a processor, a thermally conductive element disposed on the processor, wherein the thermally conductive element comprises a dielectric layer having a rubbery texture that is configured to dissipate heat from the processor, a controller, at least two connectors, and at least one integrated circuit to store data and a control application; and
a reader having an input port, an output port and at least mating two connectors, the reader having no user application processing central processing unit, the portable computer and the reader collectively having a first configuration and a second configuration, wherein:
when in the first configuration:
the portable computer and the reader are physically and operatively coupled together via the at least two connectors of the portable computer and the at least two mating connectors of the reader,
the portable computer and the reader are disposed substantially parallel to one another,
the portable computer is physically coupled to the reader via a plurality of screws,
the portable computer excludes an input/output device,
the input port and the output port of the reader provides access to the portable computer including access to the at least one integrated circuit of the portable computer, and
the portable computer sending a control signal via the control application to the reader to control the reader, and
when in the second configuration:
the portable computer and the reader are not physically and operatively coupled together,
the portable computer is not functional as a general purpose computer,
the input port and the output port of the reader does not provide access to the portable computer including not providing access to the at least one integrated circuit of the portable computer,
the reader is a non-functioning shell when the reader is not connected to the portable computer,
a physical disconnection of the reader from the portable computer prevents access and power to the portable computer, thereby rendering the portable computer not functional as a general purpose computer, and
the portable computer not sending the control signal to the reader and the reader not being controlled by the portable computer.

US Pat. No. 11,113,227

ERASING DEVICE FOR LONG-TERM MEMORY DEVICES


1. A stand-alone, dedicated function device for removing data from one or more target devices, wherein said target devices have one or more digital storage devices, and one or more USB ports, the dedicated function device comprising:a. one or more hub modules, each hub module comprising:1. means to interface with a USB port on a target device,
2. a USB hub connected to the means to interface with a USB port,
3. USB mass storage connected to the USB hub, wherein the USB mass storage is configured to be a bootable device,
4. a USB Device Converter connected to the USB hub,

b. a processing module connected to one or more hub modules through the USB Device Converter in the hub module, the processing module configured to communicate with a target that has booted from the USB mass storage in a hub module and further configured to communicate with a user,
c. a casing configured to contain one or more hub modules and the processing module.

US Pat. No. 11,113,226

FIRMWARE BURNING APPARATUS AND SYSTEM

SHENZHEN GOODIX TECHNOLOG...


1. A burning apparatus, comprising: a processor, a wireless communication module, at least one peripheral interface, and a memory; wherein,the processor is electrically connected to the wireless communication module, the at least one peripheral interface, and the memory respectively;
the memory is configured to store to-be-burned firmware and a system program required for operating the burning apparatus;
the processor is configured to start the system program to control the wireless communication module to be wirelessly connected to a terminal device, and receive, through the wireless communication module, the to-be-burned firmware transmitted by the terminal device; and
the processor is configured to be electrically connected to at least one target board through the at least one peripheral interface, and write the to-be-burned firmware to the at least one target board through the at least one peripheral interface;
the processor is also configured to receive, through the wireless communication module, a first part of the to-be-burned firmware transmitted by the terminal device, store the first part of the to-be-burned firmware to the memory, and write the first part of the to-be-burned firmware to the at least one target board through the at least one peripheral interface; and
the processor is also configured to delete, after finishing writing the first part of the to-be-burned firmware to the at least one target board, the first part of the to-be-burned firmware, receive, through the wireless communication module, a second part of the to-be-burned firmware transmitted by the terminal device, store the second part of the to-be-burned firmware to the memory, and write the second part of the to-be-burned firmware to the at least one target board through the at least one peripheral interface, until an entirety of the to-be-burned firmware is written to the at least one target board.

US Pat. No. 11,113,225

EXTENDING MULTICHIP PACKAGE LINK OFF PACKAGE

Intel Corporation, Santa...


1. A multi-chip package comprising:a substrate;
a first integrated circuit (IC) die mounted on the substrate; and
a second IC die mounted on the substrate and coupled to the first IC die,
the first IC die comprising:a host processor, and
a multi-chip package link (MCPL) interface coupled to the host processor, the MCPL interface including a first physical layer (PHY) block to physically transmit data to the second IC die and receive data from the second IC die over a first plurality of data lanes,
the first PHY block comprising:a first plurality of transmitters to transmit data to the second IC die, each transmitter associated with one of the first plurality of data lanes;
a first plurality of receivers to receive data from the second IC die, each receiver associated with one of the first plurality of data lanes;
a clock recovery circuit to ensure that a receiver clock signal is centered with respect to phase, the clock recovery circuit to receive a forwarded clock signal from the second IC die over a strobe lane, the clock recovery circuit including a phase interpolator to determine a phase by which to adjust the forwarded clock signal to generate a receiver clock signal;
a reference voltage generator to add an offset to an input voltage to generate a reference voltage; and
one or more samplers of the first plurality of receivers to sample data signals received over one or more of the first plurality of data lanes based on the reference voltage and the receiver clock signal;


the second IC die comprising:an off-package interface to couple the multi-chip package to another multi-chip package and at least one input/output (IO) device, the off-package interface to implement a plurality of layered protocol stacks, including a first layered protocol stack to communicate with the other multi-chip package and a second layered protocol stack to communicate with the at least one 10 device,
the off-package interface comprising:a second PHY block comprising a plurality of modular, protocol-agnostic electrical sub-blocks, each electrical sub-block to be associated with either the first layered protocol stack or the second layered protocol stack, the second PHY block further comprising:a second plurality of transmitters and receivers of a first electrical sub-block associated with a second plurality of data lanes, the second plurality of data lanes to couple the multi-chip package to the other multi-chip package,
a third plurality of transmitters and receivers of a second electrical sub-block associated with a third plurality of data lanes, the third plurality of data lanes comprising 10 lanes to couple the multi-chip package to the at least one 10 device,

a first upper layer logic block to communicate data in accordance with the first layered protocol stack,
a second upper layer logic block to communicate data in accordance with the second layered protocol stack, and
routing logic to selectively route the first upper layer logic block to the second plurality of data lanes and to selectively route the second upper layer logic block to the third plurality of data lanes.



US Pat. No. 11,113,224

DISPLAY DRIVER BOARD WITH MULTIPLE TYPE-C FULL-FUNCTION INTERFACES

SHENZHEN PARAMOUNT TECHNO...


1. A display driver board with multiple TYPE-C full-function interfaces, comprising a first TYPE-C interface and a second TYPE-C interface, wherein signal input ends of the first TYPE-C interface and the second TYPE-C interface are connected to signal output ends of a first connection device and a second connection device, respectively; power ends of the first TYPE-C interface and the second TYPE-C interface are bidirectionally connected to a PD power control circuit, and the PD power control circuit is bidirectionally connected to a system power supply through a DC-DC converter; a control signal input end of the PD power control circuit is connected to a control signal output end of a protocol chip, and a CC signal connection end of the protocol chip is connected to CC signal connection ends of the first TYPE-C interface and the second TYPE-C interface through a communication control circuit, respectively; USB2.0 signal ends of the first TYPE-C interface and the second TYPE-C interface are bidirectionally connected to a signal input end of a USB port switch, and a signal output end of the USB port switch is connected to a plurality of USB interfaces through a USB HUB chip; output signal ends of the first TYPE-C interface and the second TYPE-C interface are connected to signal input ends of a first SWITCH chip and a second SWITCH chip, respectively; a signal output end of the first SWITCH chip is connected to a first display signal processing circuit and a signal output end of the second SWITCH chip is connected to a second display signal processing circuit; a forward/reverse insertion control signal output end of the protocol chip is connected to forward/reverse insertion control signal input ends of the first SWITCH chip and the second SWITCH chip, respectively; and a selection control signal output end of the protocol chip is connected to a signal input end of the USB port switch.

US Pat. No. 11,113,223

DUAL MODE INTERCONNECT

XILINX, INC., San Jose, ...


1. A system on a chip (SoC), comprising:a first data processing engine in an array of data processing engines;
a second data processing engine in the array of data processing engines; and
an interconnect configured to transmit streaming data between the first and second data processing engines, wherein the interconnect comprises streaming interconnects, each streaming interconnect of the streaming interconnects comprising ports, wherein, for each streaming interconnect of the streaming interconnects, each port of the ports of the respective streaming interconnect is selectively configurable into a circuit switching mode and a packet switching mode,
wherein, when configured in the circuit switching mode, streaming data routed through the ports is deterministic,
wherein, when configured in the packet switching mode, streaming data routed through the ports is non-deterministic; and
wherein for each streaming interconnect of the streaming interconnects, each port of the ports of the respective streaming interconnect:when configured in the circuit switching mode, cannot be shared by multiple logical streams; and
when configured in the packet switching mode, is capable of being shared by multiple logical streams.


US Pat. No. 11,113,222

NAND SWITCH

KIOXIA CORPORATION, Toky...


1. A memory system comprising:a controller configured with a first enable output and a data output;
a plurality of non-volatile storage devices, each configured with an enable input and a data input; and
a first switch configured between the controller and a first set of the plurality of non-volatile storage devices, witha first enable input that is connected to the first enable output of the controller,
a first data input that is connected to the data output of the controller,
a first data output that is connected to the data input of each of the first set of non-volatile storage devices, and
a plurality of enable outputs, each of the enable outputs being connected to the enable input of one of the first set of non-volatile storage devices,

wherein in response to the controller asserting the first enable output and transmitting select data which indicates one of the enable outputs of the first switch connected to an enable input of a first non-volatile storage device among the first set of non-volatile storage devices,the first switch enables a first communication path between the controller and the first non-volatile storage device, and transmits a command and an address of the first non-volatile storage device which are received from the controller, to a data input of the first non-volatile storage device.


US Pat. No. 11,113,221

MODE SWITCHING SYSTEM AND MODE SWITCHING METHOD USING THE SAME

Qisda Corporation, Taoyu...


1. A mode switching system, comprising:a first electronic device, comprising:a main control unit;
a universal serial bus (USB) Type-C interface controller coupled to the main control unit;
a USB hub coupled to the interface controller; and

a second electronic device coupled to the interface controller of the first electronic device;
wherein the main control unit is configured to:disable the USB hub in response to a mode switching instruction;
switch the mode of the interface controller from a first mode to a second mode; and
command the interface controller to re-communicate with the second electronic device.


US Pat. No. 11,113,220

SINGLE-WIRE PEER-TO-PEER BUS

Qorvo US, Inc., Greensbo...


1. A single-wire peer-to-peer (P2P) bus apparatus comprising:a first peer device coupled to a single-wire bus and assigned a first bus access priority, the first peer device is configured to broadcast an opening start-of-sequence (SOS) sequence configured to start telegram communication and provide a timing reference for at least one second peer device; and
the at least one second peer device coupled to the single-wire bus and assigned at least one second bus access priority lower than the first bus access priority;
wherein at least one selected peer device among the first peer device and the at least one second peer device is configured to:assert a bus contention indication when the single-wire bus is in a defined bus state configured to permit bus contention;
determine whether the bus contention indication is successful based on the first bus access priority of the first peer device and the at least one second bus access priority of the at least one second peer device; and
communicate over the single-wire bus in response to the bus contention indication being successful.


US Pat. No. 11,113,219

PROTOCOL DATA UNIT END HANDLING WITH FRACTIONAL DATA ALIGNMENT AND ARBITRATION FAIRNESS

NXP USA, Inc., Austin, T...


1. A method for handling data units in a multi-user system comprising:granting a shared resource to a user of a plurality of users for a transaction associated with an entry of a transaction data structure;
determining whether the transaction stored last partial data of a data unit associated with the user in an alignment register associated with the user; and
asserting a request for arbitration of a plurality of transactions associated with the plurality of users, the request being asserted for an additional transaction associated with the entry in response to determining that the transaction stored the last partial data in the alignment register.

US Pat. No. 11,113,218

SEMICONDUCTOR DEVICE AND METHOD FOR PROTECTING BUS

RENESAS ELECTRONICS CORPO...


1. A semiconductor device comprising:a first set includinga first bus master,
a first master interface provided between the first bus master and a bus, and
a first protocol conversion unit provided in the bus,
wherein the first bus master outputs first data generated based on a first protocol,
wherein the first master interface includes a first copy data generation unit for generating first copy data by copying the first data, and a first code generation unit for generating a first error detection code based on the first copy data, and a first identifier addition unit for adding a first protocol identifier representing the first protocol used in the first bus master to the first copy data,
wherein the first protocol conversion unit generates a second data by converting the first data from the first protocol to a second protocol,

a second set includinga second bus master,
a second master interface provided between the second bus master and the bus, and
a second protocol conversion unit provided in the bus,
wherein the second bus master outputs third data generated based on a third protocol,
wherein the second master interface includes a second copy data generation unit for generating second copy data by copying the third data, and a second code generation unit for generating a second error detection code based on the second copy data, and a second identifier addition unit for adding a second protocol identifier representing the third protocol used in the second bus master to the second copy data, the third protocol being different from the first protocol,
wherein the second protocol conversion unit generates fourth data by converting the third data from the third protocol to the second protocol,

a bus slave,
a slave interface provided between the bus slave and the bus,
wherein the slave interface receives the second data, the first copy data, the first error detection code, and the first protocol identifier from the first protocol conversion unit, and the fourth data, the second copy data, the second error detection code, and the second protocol identifier from the second protocol conversion unit,
wherein the slave interface includesan error detection unit for detecting an error of the first copy data based on the first error detection code and an error of the second copy data based on the second error detection code
a first verification protocol conversion unit for the first protocol conversion unit, the first verification protocol conversion unit generating first verification data by converting one of the second data and the first copy data from one of the first protocol and the second protocol to another one the first protocol and the second protocol,
a second verification protocol conversion unit for the second protocol conversion unit, the second verification protocol conversion unit generating second verification data by converting one of the fourth data and the second copy data from one of the third protocol and the second protocol to another one of the third protocol and the second protocol,
a comparator for comparing the first verification data with third verification data that is another one of the second data and the first copy data, and comparing the second verification data with fourth verification data that is another one of the fourth data and the second copy data, and
a selector for selecting one of the first and second verification protocol conversion units for the comparator based on the first and second protocol identifiers added to the first and second copy data by the first and second identifier addition units, respectively.


US Pat. No. 11,113,217

DELIVERING INTERRUPTS TO USER-LEVEL APPLICATIONS

Intel Corporation, Santa...


1. A processing system, comprising:a memory to store an interrupt control data structure associated with an application being executed by the processing system; and
a processing core to, without a privilege level transition:determine that an identifier of a pending interrupt matches a notification interrupt vector associated with the application,
set, in the interrupt control data structure, a pending interrupt flag corresponding to an identifier of the interrupt,
select a highest priority pending interrupt among pending interrupts identified by the interrupt control data structure, and
invoke an interrupt handler for the highest priority pending interrupt identified by the interrupt control data structure.


US Pat. No. 11,113,216

DISPATCHING INTERRUPTS IN A MULTI-PROCESSOR SYSTEM BASED ON POWER AND PERFORMANCE FACTORS

MediaTek Inc., Hsinchu (...


1. A system for handling interrupts, comprising:a plurality of processors;
an interrupt controller; and
a plurality of interrupt-generating devices, wherein the interrupt controller is operative to:receive a power and performance status of each processor, the power and performance status indicated by a plurality of factors that affect power consumption and processor performance;
receive a request for an interrupt from one of the interrupt-generating devices, the interrupt being generated in a usage scenario of the system;
calculate a weighted combination of the factors for each processor, wherein each factor is weighted based on the usage scenario;
identify one of the processors for handling the interrupt based on the weighted combination calculated for each processor; and

dispatch the interrupt to the identified one of the processors.

US Pat. No. 11,113,215

ELECTRONIC DEVICE FOR SCHEDULING A PLURALITY OF TASKS AND OPERATING METHOD THEREOF

Samsung Electronics Co., ...


1. An electronic device comprising:a processor; and
a memory operatively connected to the processor,
wherein, when being executed, the memory stores instructions that cause the processor to:detect occurrence of an interrupt requesting performance of a second task while performing a first task;
identify a user based on a voice command of the user corresponding to the interrupt;
determine whether the identified user is a same as a user of the first task;
in response to determining that the identified user and the user of the first task are not the same, obtain an affinity of the user of the first task and an affinity of the user of the second task;
obtain reference values according to a time of the first task based on the affinity of the user of the first task, and reference values according to a time of the second task based on the affinity of the user of the second task;
schedule the first task and the second task based on a reference value of the first task and a reference value of the second task, the reference value of the first task and the reference value of the second task each corresponding to a time at which the interrupt occurs; and
process the first task and the second task based on a result of the scheduling.


US Pat. No. 11,113,214

CONTROLLING DATA TRANSFERS BETWEEN A TIER OF PERSISTENT DATA STORAGE AND PROCESSOR MEMORY WITH A HIGH-SPEED FABRIC CONTROLLER

LENOVO Enterprise Solutio...


1. An apparatus comprising:a high-speed fabric controller;
a memory controller connected between a high-speed memory and a processor, the memory controller configured to control processor access to the high-speed memory over a memory bus between the processor and the high-speed memory;
a data connection between the processor and the high-speed fabric controller;
a high-speed data connection between the memory controller and the high-speed fabric controller; and
a data connection between a tier of persistent data storage and the high-speed fabric controller,
wherein the high-speed data connection between the memory controller and the high-speed fabric controller is separate from of the connection between the processor and the high-speed fabric controller, and
wherein the high-speed fabric controller is configured to control data transfers between the tier of persistent data storage and the high-speed memory over the high-speed data connection and independent of the processor.

US Pat. No. 11,113,213

DETERMINING WRITE COMMANDS FOR DELETION IN A HOST INTERFACE

Micron Technology, Inc., ...


1. A system comprising:a memory device;
a processing device coupled to the memory device and configured to control cache memory for the memory device; and
an interface coupled to the processing device and configured to:determine that a particular write command received from a host has a same address as a subsequently received write command from the host;
delete the particular write command in response to the particular write command not having been provided to the processing device; and
signal the processing device to delete the particular write command in response to the particular write command having been provided to the processing device;

wherein the processing device is configured to delete the particular write command in response to the signal.

US Pat. No. 11,113,212

MULTI-LEVEL RECEIVER WITH TERMINATION-OFF MODE

Micron Technology, Inc., ...


1. A method, comprising:identifying, for a first set of receivers coupled with a channel, a first mode for receiving a first signal modulated according to a first scheme that includes three or more levels;
identifying, for a second set of receivers coupled with the channel, a second mode for receiving a second signal according to a second scheme that includes two levels;
determining whether to use the first mode for the first set of receivers or the second mode for the second set of receivers for an access operation over the channel;
selecting, for performing the access operation, a receiver path comprising the first set of receivers or the second set of receivers based at least in part on determining whether to use the first mode or the second mode; and
receiving, based at least in part on selecting the receiver path comprising the first set of receivers or the second set of receivers, the first signal using the first set of receivers or the second signal using the second set of receivers.

US Pat. No. 11,113,211

MEMORY DEVICE SUPPORTING RANK-LEVEL PARALLELISM AND MEMORY SYSTEM INCLUDING THE SAME

SK hynix Inc., Icheon (K...


1. A memory system comprising one or more of memory modules coupled to a memory controller through a channel, each of the one or more of memory modules comprising a plurality of ranks, each of the plurality of ranks comprising a plurality of memory devices, wherein each of the plurality of memory devices comprises:a cell region;
a row control circuit configured to control a row operation of the cell region;
a column control circuit configured to control a column operation of the cell region;
a command decoder configured to process a command provided from the memory controller and to control the row control circuit and the column control circuit;
a data transceiver configured to transmit/receive data to/from the channel according to control of the command decoder; and
an intermediate buffer configured to communicate with the column control circuit or the data transceiver according to a first plurality of control signals from the command decoder,
wherein the memory device further comprises a path setting circuit including a first selector and a second selector, the first selector configured to couple the column control circuit to the data transceiver or the intermediate buffer, the second selector configured to couple the data transceiver to the column control circuit or the intermediate buffer, so that the path setting circuit sets a first data transmission path between the column control circuit and the intermediate buffer, a second data transmission path between the data transceiver and the intermediate buffer, or a third data transmission path between the column control circuit and the data transceiver, according to a second plurality of control signals from the command decoder.

US Pat. No. 11,113,210

MEMORY DEVICE SUPPORTING RANK-LEVEL PARALLELISM AND MEMORY SYSTEM INCLUDING THE SAME

SK hynix Inc., Icheon (K...


1. A memory device comprising:a cell region;
a row control circuit configured to control a row operation of the cell region;
a column control circuit configured to control a column operation of the cell region;
a command decoder configured to process a command provided from a memory controller and to control the row control circuit and the column control circuit;
a data transmitter/receiver configured to transmit or receive data according to control of the command decoder;
an intermediate buffer configured to communicate with the column control circuit or the data transmitter/receiver according to a first plurality of control signals from the command decoder; and
a path setting circuit including a first selector and a second selector, the first selector configured to couple the column control circuit to the data transmitter/receiver or the intermediate buffer, the second selector configured to couple the data transmitter/receiver to the column control circuit or the intermediate buffer, so that the path setting circuit sets a first data transmission path between the column control circuit and the intermediate buffer, a second data transmission path between the data transmitter/receiver and the intermediate buffer, or a third data transmission path between the column control circuit and the data transmitter/receiver, according to a second plurality of control signals from the command decoder.

US Pat. No. 11,113,209

REALM IDENTIFIER COMPARISON FOR TRANSLATION CACHE LOOKUP

Arm Limited, Cambridge (...


1. A method comprising:storing a plurality of entries in a translation cache, each entry specifying address translation data for a corresponding memory region, a translation context identifier identifying a translation context associated with the address translation data, and a realm identifier identifying one of a plurality of realms, each realm corresponding to at least a portion of at least one software process executed by processing circuitry;
triggering a lookup of the translation cache in response to a memory access to a target memory region issued from a current translation context and a current realm; and
when the lookup misses in the translation cache, preventing allocation of address translation data to the translation cache in response to the memory access when the current realm is excluded from accessing the target memory region by an owner realm specified from among the plurality of realms for the target memory region;
wherein the lookup comprises determining whether said memory access matches a given entry of the translation cache in dependence on a first comparison between the translation context identifier specified by the given entry and a translation context identifier of said current translation context and a second comparison between the realm identifier specified by the given entry and a realm identifier of said current realm.

US Pat. No. 11,113,208

PSEUDO-FIRST IN, FIRST OUT (FIFO) TAG LINE REPLACEMENT

TEXAS INSTRUMENTS INCORPO...


1. A method comprising:searching tags in a first tag group comprised in a tagged memory system for an available tag line during a first clock cycle, wherein the tagged memory system comprises a plurality of tag lines having respective tags and wherein the tags are divided into a plurality of non-overlapping tag groups; and
searching tags in a next tag group of the plurality of non-overlapping tag groups for an available tag line during a next clock cycle when the searching in the first tag group does not find an available tag line;
wherein the searching tags in the first tag group starts with a tag in the first tag group immediately after a tag associated with a tag line that was allocated in a previous search.

US Pat. No. 11,113,207

BYPASS PREDICTOR FOR AN EXCLUSIVE LAST-LEVEL CACHE

SAMSUNG ELECTRONICS CO., ...


1. A method to allocate data evicted from a first cache to a second cache, the method comprising:determining upon eviction of a block of data from the first cache whether a reuse indicator for the block of data indicates that the block of data has been reused from the first cache or the second cache, the first cache being a higher level cache than the second cache;
incrementing a first counter based on the reuse indicator for the block of data indicating that the block of data has been reused;
decrementing the first counter based on the reuse indicator for the block of data indicating that the block of data has not been reused;
incrementing a second counter upon eviction of the block of data from the first cache;
comparing a value of the first counter to a first predetermined threshold;
determining whether a value of the second counter is equal to zero;
allocating the block of data to the second cache based on the value of the first counter being equal to or greater than the first predetermined threshold or the value of the second counter equaling zero; and
writing the block of data to a system memory while bypassing the second cache based on the value of the first counter being less than the first predetermined threshold and the value of the second counter being not equal to zero.

US Pat. No. 11,113,206

CACHE DATA LOCATION SYSTEM

Hewlett Packard Enterpris...


1. A method comprising:storing a direct cache address translation data structure in a volatile memory that directly translates a block logical address for targeted data to a candidate physical location on a cache device;
storing a multilevel translation index in the volatile memory that is usable to translate the block logical address for the targeted data to an expected physical location on the cache device;
determining if the targeted data resides at the candidate physical location retrieved from the direct cache address translation data structure; and
in response to the targeted data not residing at the candidate physical location:accessing the targeted data at the expected physical location retrieved from the multilevel translation index; and
caching the retrieved expected physical location in the direct cache address translation structure, including modifying the direct cache address translation data structure to:disassociate the candidate physical address from the block logical address for the targeted data; and
associate retrieved expected physical location to the block logical address for the targeted data.



US Pat. No. 11,113,205

DIE ADDRESSING USING A REDUCED SIZE TRANSLATION TABLE ENTRY

Micron Technology, Inc., ...


1. An apparatus, comprising:an array of memory cells comprising a plurality of dies; and
a memory cache configured to store at least a portion of an address mapping table, wherein:the address mapping table comprises entries that map translation units (TUs) to physical locations in the array, and
the entries comprise data that indicate a location within the array that stores a particular TU without including data that indicates which die of the plurality of dies of the array the TU is stored in; and

a controller configured to:write TUs across a block stripe that includes a respective block of each of the plurality of dies, wherein:each of the TUs are only written to a single die of the plurality of dies;
a write cursor indicates which respective block stripe of which respective die each of the TUs are to be written to; and
a sub-write cursor indicates which location within the respective block stripe of the respective die to write each respective TU; and

write the particular TU to a respective block of a die in the block stripe, wherein the particular TU is not written to the other dies in the block stripe.


US Pat. No. 11,113,204

TRANSLATION INVALIDATION IN A TRANSLATION CACHE SERVING AN ACCELERATOR

International Business Ma...


1. An integrated circuit for a coherent data processing system including a system memory, the integrated circuit comprising:a first communication interface for communicatively coupling the integrated circuit with the coherent data processing system;
a second communication interface for communicatively coupling the integrated circuit with an accelerator unit such that all memory access requests of the accelerator unit requesting data in the system memory are received by the integrated circuit, wherein:the accelerator unit includes an effective address-based accelerator cache having multiple data entries for buffering copies of data from the system memory of the coherent data processing system;
the accelerator cache tracks contents of the data entries based on effective addresses within an effective address space; and
the integrated circuit is configured to refrain from communicating real addresses with the accelerator unit;

a real address-based directory having multiple directory entries, wherein the real address-based directory is inclusive of contents of the accelerator cache, and wherein the real address-based directory assigns directory entries to track which data are stored in the accelerator cache based on real addresses utilized to identify storage locations in the system memory; and
request logic configured to, based on receipt on the first communication interface of a translation entry invalidation request, issue to the accelerator unit via the second communication interface an invalidation request that identifies a data entry among the multiple data entries in the effective address-based accelerator cache to be invalidated, wherein the invalidation request identifies the data entry in the effective address-based accelerator cache utilizing a host tag identifying a directory entry in the real address-based directory.

US Pat. No. 11,113,203

CONTROLLER AND METHOD OF OPERATING THE SAME

SK hynix Inc., Gyeonggi-...


1. A controller for controlling an operation of a semiconductor memory device, the controller comprising:a map cache configured to store a first mapping segment including a plurality of mapping entries and a flag bit; and
a map cache controller configured to:
set a value of the flag bit depending on whether data corresponding to the first mapping segment is random data or sequential data;
receive a second mapping segment from the semiconductor memory device when the second mapping segment corresponding to a read request from a host is in a cache miss in the map cache; and
store the second mapping segment in one of a random map cache and a sequential map cache based on a value of a flag bit included in the second mapping segment.

US Pat. No. 11,113,202

OPERATING METHOD FORCING THE SECOND OPERATION TO FAIL USING A SCATTER-GATHER BUFFER AND MEMORY SYSTEM THEREOF

SK hynix Inc., Gyeonggi-...


1. A memory system, comprising:a memory device including a memory block, a page buffer, and first and second memory dies;
a write buffer suitable for temporarily storing first and second data;
a program managing unit suitable for controlling the memory device to sequentially perform first and second program operations on the memory block with the first and second data;
a buffer managing unit suitable for managing the write buffer based on a scatter-gather scheme;
a failure processing unit suitable for forcing the second program operation to fail when the first program operation is a failure; and
an error handling unit suitable for controlling the program managing unit to perform the first and second program operations again for the first and second data that are temporarily stored in the write buffer when the second program operation is forced to fail.

US Pat. No. 11,113,201

FLASH MEMORY CONTROLLER, METHOD AND ASSOCIATED ELECTRONIC DEVICE FOR MANAGING PRIORITY OF QUALITY DETECTION OR GARBAGE COLLECTION OF BLOCK

Silicon Motion, Inc., Hs...


1. A flash memory controller, wherein the flash memory controller is arranged to access a flash memory module, the flash memory module comprises a plurality of blocks, and the flash memory controller comprises:a read-only memory (ROM), configured to store a program code;
a microprocessor, configured to execute the program code to control the access of the flash memory module; and
a decoder;
wherein when the flash memory controller is powered on, the microprocessor reads data of a plurality of pages from a specific block in the flash memory module, and the decoder decodes data of said plurality of pages; and when any page within said plurality of pages cannot be decoded successfully, the microprocessor seals the specific block in order to raise a priority of quality detection or garbage collection of the specific block.

US Pat. No. 11,113,199

LOW-OVERHEAD INDEX FOR A FLASH CACHE

EMC IP HOLDING COMPANY LL...


1. A method for managing data segments stored in a cache, the method comprising:storing an index in a memory, wherein the index includes entries corresponding to data segments stored in the cache, wherein each entry in the index includes a short identifier and metadata associated with a data segment;
detecting a collision when multiple short identifiers in the index satisfy a query to the index, wherein the query is associated with an operation on a specific data segment in the cache and wherein the query is associated with information about the specific data segment;
resolving the collision based on the metadata associated with the multiple short identifiers that satisfy the query by identifying, from among entries in the index associated with the multiple short identifiers, a specific entry that includes a combination of a short identifier that satisfies the query and metadata that matches the information about the specific data segment; and
performing the operation on the specific data segment in the cache identified in the specific entry.

US Pat. No. 11,113,198

TIMED DATA TRANSFER BETWEEN A HOST SYSTEM AND A MEMORY SUB-SYSTEM

Micron Technology, Inc., ...


1. A method, comprising:receiving, in a memory sub-system, a plurality of streams of write commands from a host system;
identifying a plurality of media units in the memory sub-system, wherein the plurality of media units are identified to be available to write data from the plurality of streams concurrently;
selecting first commands from the plurality of streams for concurrent execution in the plurality of media units;
initiating, by the memory sub-system and in response to the first commands from a plurality of write streams being selected for concurrent execution in the plurality of media units, communication of first data of the first commands from the plurality of write streams from the host system to a local buffer memory of the memory sub-system, wherein the memory sub-system buffers, in the local buffer memory, no more than a predetermined number of units of data; the predetermined number corresponds to a number of media units in the memory sub-system that are capable of operating independent from each other in writing data; and each unit of data is no more than a maximum amount of data to be written in a media unit in response to a single write command;
queuing write commands more than the predetermined number in at least one command queue configured in the local memory of the memory sub-system; and
executing the first commands concurrently by storing the first data into the plurality of memory units.

US Pat. No. 11,113,197

PUNCTUATION CONTROLLED TEMPORAL REFERENCE DATA LOOKUP

Microsoft Technology Lice...


1. A method for joining an event stream with reference data, the method being implemented by a compute processor in an event stream processing system, the method comprising:sending a request to a reference data manager;
receiving a punctuation event from the reference data manager in response to the request, wherein the punctuation event comprises a punctuation event timestamp, wherein the reference data manager determines the punctuation event timestamp by selecting a highest timestamp out of a plurality of timestamps associated with a plurality of reference data snapshots in a cache, and wherein the reference data manager causes at least one new reference data snapshot to be added to the cache when a difference between the highest timestamp out of the plurality of timestamps associated with the plurality of reference data snapshots in the cache and a timestamp that is associated with a most recent data request sent by the compute processor is less than a predefined threshold value;
providing a logical barrier that restricts a flow of data events in the event stream to a cache lookup operation based on the punctuation event;
performing a first cache lookup operation with respect to a first data event in the event stream, the first data event having a first timestamp that is earlier than the punctuation event timestamp; and
delaying a second cache lookup operation from being performed with respect to a second data event in the event stream, the second data event having a second timestamp that is later than the punctuation event timestamp.

US Pat. No. 11,113,196

SHARED BUFFERED MEMORY ROUTING

Intel Corporation, Santa...


1. An apparatus comprising:a first device comprising at least a portion of an interconnect fabric, a first shared memory controller to control access to first shared memory, and a first plurality of processor nodes, wherein the first device further comprises an interface to receive a data request from a second device over a data link, the interface comprises physical layer circuitry to implement a physical layer for the data link according to a physical layer protocol, and the interface further comprises first link layer circuitry to implement a first link layer protocol and second link layer circuitry to implement a different second link layer protocol,
wherein the data link comprises a plurality of lanes, the data link supports multiplexing of data of the different first and second link layer protocols over the same physical layer of the data link, the first shared memory is not directly connected to the processor nodes, and the second device comprises a second shared memory controller to couple and control access to second shared memory, and a second plurality of processor nodes,
wherein the data request comprises link layer data, the data request is addressed to be routed to the first memory controller through the interconnect fabric from the second device, and the first memory controller is to handle the data request, wherein the data request comprises a node identifier to identify a particular processor node of the second plurality of processor nodes as a source of the data request, and the data request further comprises an address to identify a portion of the first shared memory associated with the data request.

US Pat. No. 11,113,195

METHOD, DEVICE AND COMPUTER PROGRAM PRODUCT FOR CACHE-BASED INDEX MAPPING AND DATA ACCESS

EMC IP Holding Company LL...


1. A method of accessing data, comprising:receiving, by a system comprising a processor, a request to access first data in a storage device, at least a part of data in the storage device being cached in a cache, and index information of at least the part of data being recorded in an index structure associated with the cache, wherein the index structure is not included in the cache and comprises:a first identifier data structure that is indicative of a key of a key-value pair architecture, wherein the first identifier data structure identifies a tree structure;
a second identifier data structure that is indicative of a value of the key-value pair architecture, wherein the second identifier data structure identifies the first data within the tree structure; and
a timestamp data structure that stores timestamp data indicative of a time at which associated data in the cache was last accessed;

querying the index structure to determine whether the first data is cached in the cache; and
accessing the first data based on a result of the query.

US Pat. No. 11,113,194

PRODUCER-TO-CONSUMER ACTIVE DIRECT CACHE TRANSFERS

XILINX, INC., San Jose, ...


1. A computing system, comprising:a producer comprising a first processing element configured to generate processed data;
a producer cache configured to store the processed data generated by the producer;
a consumer comprising a second processing element configured to receive and process the processed data generated by the producer; and
a consumer cache configured to store the processed data generated by the consumer,
wherein the producer is configured to, in response to receiving a stash cache maintenance operation (stash-CMO), perform a direct cache transfer (DCT) to transfer the processed data from the producer cache to the consumer cache.

US Pat. No. 11,113,193

PREDICTIVE DATA STORAGE HIERARCHICAL MEMORY SYSTEMS AND METHODS

Micron Technology, Inc., ...


1. An apparatus comprising:a processing system; and
a memory system communicatively coupled to the processing system via one or more communication buses and configured to provide data storage via a plurality of hierarchical memory levels, wherein the memory system comprises:
a first one or more caches configured to implement a first memory level of the plurality of hierarchical memory levels; and
one or more memory controllers, wherein:
the processing system is configured to output first data to be stored in the memory system and a write memory access request that indicates first context of the first data; and
in response to receipt of the write memory access request, the one or more memory controllers are configured to:
determine a predicted data access pattern at least in part by determining a next predicted target time of the first data based at least in part on the first context of the first data indicated in the write memory access request, second context of second data previously stored in the memory system, or both; and
control what one or more memory levels in which to store the first data at least in part by instructing the memory system to store the first data in the first memory level implemented using the first one or more caches when a duration between a current time and the next predicted target time of the first data is less than a first duration threshold associated with the first memory level.

US Pat. No. 11,113,192

METHOD AND APPARATUS FOR DYNAMICALLY ADAPTING CACHE SIZE BASED ON ESTIMATED CACHE PERFORMANCE

EMC IP Holding Company LL...


1. A method of dynamically adjusting sizes of cache partitions of a cache, comprising:using an eviction list data structure and potential hit gain counter to determine a potential cache partition hit rate increase of a first of the cache partitions if a size of the first of the cache partitions is increased by a first amount; and
using a potential hit loss counter to sum cache hits that occur in a tail portion of a second of the cache partitions to determine a potential cache partition hit decrease of the second of the cache partitions if a size of the second of the cache partitions is reduced by a second amount;
wherein using the potential hit loss counter to sum cache hits that occur in the tail portion of the second of the cache partitions to determine the potential cache partition hit decrease comprises determining, for each cache hit, where the cache hit occurred in the second of the cache partitions, and if the cache hit occurred in the tail portion of the second of the cache partitions, incrementing the potential hit loss counter.

US Pat. No. 11,113,191

DIRECT AND INDIRECT ADDRESSING POINTERS FOR BIG DATA


1. A non-transitory computer tangible medium containing instructions which, when executed, perform a direct-addressing method for storing data sets in a data store, comprising:calculating two or more different hash digests for a block of data from a data set to be stored within a data store by hashing the block of data in two or more different orders with the same hash algorithm; and
forming direct-addressing pointers for directly storing the block of data based on the two or more different hash digests.

US Pat. No. 11,113,190

MUTABLE TYPE BUILDER

Microsoft Technology Lice...


1. A computing device implemented method for building a mutable type in a heap, the method comprising:generating a data structure for a developer written program from a class library, the data structure having a contiguous section of memory, the contiguous section of memory of the data structure having an element portion and an over-allocation portion, the element portion storing elements accessible with an index, the elements stored in the data structure with the exception of the over-allocation portion;
resizing the data structure within the heap into a final allocation of memory when the contiguous section of memory is consumed with the elements with the exception of the over-allocation portion as unused portion of the data structure;
inserting a gap object into the over-allocation portion of the data structure in the final allocation of the memory to mark a version of memory to be freed; and
garbage collecting the gap object for a final size of the data structure.

US Pat. No. 11,113,189

MEMORY SYSTEM TO PERFORM READ RECLAIM AND GARBAGE COLLECTION, AND METHOD OF OPERATING THE SAME

SK hynix Inc., Gyeonggi-...


12. A memory system comprising:a memory device including a plurality of memory blocks;
a controller configured to control the memory device to perform a read reclaim operation based on a read count value of a memory block on which a read operation has been completed or generate level information based on the read count value of the memory block; and
a host configured to manage, based on the level information, a read count value of each of logical addresses corresponding to memory blocks on which the read operation has been completed and output a host command corresponding to a garbage collection operation of the memory device based on the read count value of each of the logical addresses,
wherein the level information is a ratio of the read count value with reference to a read count threshold value of the read reclaim operation.

US Pat. No. 11,113,188

DATA PRESERVATION USING MEMORY APERTURE FLUSH ORDER

Microsoft Technology Lice...


1. A data preservation subsystem in a computing system, the data preservation subsystem comprising:a battery-backed memory having an aperture, the memory including digital data storage locations addressed in a physical address space, the aperture including at least a portion of said digital data storage locations, the aperture having a physical address flush order which is an order of copying data from the aperture to an aperture-associated non-volatile storage in response to a data integrity threat, the flush order defining a first-to-flush physical address end of the aperture and a last-to-flush physical address end of the aperture;
a data preservation circuitry in operable communication with the battery-backed memory, the data preservation circuitry configured to perform data preservation steps that include (a) receiving a request to store a dataset A-data in the aperture, the A-data including data which is designated as critical data, (b) identifying a portion A-memory of unallocated memory of the aperture, the A-memory being large enough to hold the A-data, the A-memory having a physical address which is closer to the aperture first-to-flush physical address end than any other physical address of any other unallocated memory of the aperture, (c) marking the A-memory as allocated and placing a copy of the A-data in the A-memory, (d) receiving a request to store a dataset Z-data in the aperture, the Z-data not including any data which is designated as critical data, (e) identifying a portion Z-memory of unallocated memory of the aperture, the Z-memory being large enough to hold the Z-data, the Z-memory having a physical address which is closer to the aperture last-to-flush end than any other physical address of any other unallocated memory of the aperture, (f) marking the Z-memory as allocated and placing a copy of the Z-data in the Z-memory;
wherein the data preservation subsystem provides a higher likelihood of successfully flushing critical data and thereby preserving it than by storing data in the battery-backed memory without regard to data criticality.

US Pat. No. 11,113,187

MOCK SERVER FOR TESTING

INTUIT, INC., Mountain V...


1. A method for providing application programming interface (API) response instructions for testing an application, comprising:creating, at a client device:response instructions indicating how a mock server is to respond to an API request; and
a response value;

sending, from the client device to the mock server, the API request comprising the response instructions and the response value;
receiving, from the mock server at the client device, an API response, wherein:the API response is based on the response;
if the response instructions in the PI request comprise executable code, the API response comprises a transformed response value generated by executing the executable code; and
if the response instructions in the request do not comprise executable code, the API response comprises the response value; and

testing the application with the API response.

US Pat. No. 11,113,186

TESTING AND PUBLISHING OF RESOURCE HANDLERS IN A CLOUD ENVIRONMENT

Amazon Technologies, Inc....


1. A computer-implemented method comprising:providing, by a service provider network, a code-development interface configured to receive input data that defines a type of a computing resource and first resource handlers usable by the service provider network, individual ones of the first resource handlers being associated with creating the type of the computing resource hosted on a device disposed in a network that is remote from the service provider network;
receiving, via the code-development interface, the input data defining the first resource handlers;
generating, utilizing the input data, the first resource handlers associated with the type of the computing resource;
storing the first resource handlers in association with account data of a user account associated with the service provider network;
publishing the type of the computing resource in a registry associated with the service provider network;
receiving, utilizing the code-development interface, an indication that the computing resource has been modified;
generating second resource handlers in response to receiving the indication that the computing resource has been modified;
publishing the second resource handlers to the registry;
determining that a number of faults associated with creating the computing resource utilizing the second resource handlers satisfies a threshold number of faults;
querying the account data for the first resource handlers;
publishing the first resource handlers to the registry in place of the second resource handlers in response to determining that the number of faults satisfies the threshold number of faults;
receiving, from the user account, an infrastructure template that defines configuration data for creating the type of the computing resource; and
creating, utilizing at least one of the first resource handlers, an instance of the type of the computing resource on behalf of the user account.

US Pat. No. 11,113,185

AUTOMATED CODE TESTING FOR CODE DEPLOYMENT PIPELINE BASED ON RISK DETERMINATION

Adobe Inc., San Jose, CA...


1. A method for monitoring code changes in a multistage automated code deployment pipeline, the method comprising:generating a repository risk score based on a collection of historical outcomes of code submissions to a code repository and additional data describing the code repository;
generating a code change risk score based on a history of a code change in the code repository including a ratio of a number of times the code change has failed to a number of times the code change successfully passed a stage in the multistage automated code deployment pipeline, a number of lines of code in the code repository that are changed by the code change, an age of the code change, a number of quality gate failure exceptions given for the code change, and how many code changes a developer of the code change has merged with the code repository;
generating a developer risk score based on a collection of historical outcomes of code submissions by the developer;
determining a risk profile for the code change based on the repository risk score, the code change risk score, and the developer risk score;
determining whether the risk profile meets a verification criteria; and
preventing, in response to determining that the risk profile meets the verification criteria, the code change from progressing to a next stage in the multistage automated code deployment pipeline.

US Pat. No. 11,113,184

DISPLAY IN A GRAPHICAL FORMAT OF TEST RESULTS GENERATED USING SCENARIO MODELS

Breker Verification Syste...


1. A method comprising:generating a stimulus to be applied to an input of one of a first plurality of driver scenario models based on an expected result to be achieved at an output of one of a second plurality of driver scenario models, wherein the one of the first plurality of driver scenario models represents a first function and the one of the second plurality of driver scenario models represents a second function, wherein said generating the stimulus includes back propagating the expected result from an output of the second function represented by the one of the second plurality of driver scenario models via the second function represented by the one of the second plurality of driver scenario models and via the first function represented by the one of the first plurality of driver scenario models to determine the stimulus at an input node of the first function, wherein the first function and the second function are associated with a test of a design of one or more systems on chips (SoCs), wherein the one of the first plurality of driver scenario models is configured to be executed during an emulation stage, a prototyping stage, and a post-silicon stage of the one or more SoCs;
generating a graphical display of multiple computer threads including a first computer thread and a second computer thread, wherein the graphical display of the multiple computer threads includes a graphical display of the first computer thread and a graphical display of the second computer thread, wherein the graphical display of the first computer thread includes a graphical display of the one of the first plurality of driver scenario models and the graphical display of the second computer thread includes a graphical display of the one of the second plurality of driver scenario models, wherein the graphical display of the one of the first plurality of driver scenario models of the first computer thread graphically conveys a state of execution of the one of the first plurality of driver scenario models of the first computer thread and the graphical display of the one of the second plurality of driver scenario models of the second computer thread graphically conveys a state of execution of the one of the second plurality of driver scenario models of the second computer thread; and
identifying, within the graphical display of the multiple computer threads, a directionality of flow of execution from the graphical display of the one of the first plurality of driver scenario models of the first computer thread to the graphical display of the one of the second plurality of driver scenario models of the second computer thread, wherein the directionality of flow of execution provides a sequence of execution during the test from the stimulus via the one of the first plurality of driver scenario models of the first computer thread to the one of the second plurality of driver scenario models of the second computer thread.

US Pat. No. 11,113,183

AUTOMATED DEVICE TEST TRIAGING SYSTEM AND TECHNIQUES

Google LLC, Mountain Vie...


1. A method, comprising:providing a host computing device executing test infrastructure system software for testing a plurality of devices under test (DUTs) using a test suite having a plurality of tests to be executed by the plurality of DUTs, the plurality of DUTs comprising a first DUT and a second DUT, wherein the first DUT and the second DUT share a common design, wherein each of the plurality of DUTs utilize a common hardware component, and wherein the plurality of tests comprise a first test and a second test;
determining to execute the first test before the second test on at least the first DUT using the host computing device;
receiving, at the host computing device, first test results for a failing first test executed by the first DUT;
determining, based on the first test results and based on the first DUT sharing the common design with the second DUT, to execute the second test before the first test on the second DUT;
the host computing device subsequently instructing the second DUT to execute the second test before executing the first test; and
determining whether the first test is to be executed on the second DUT by:selecting first failing test results from the first test results, the first failing test results for one or more failed executions of the first test by the first DUT;
analyzing the first failing test results to determine whether the common hardware component is associated with the first failing test results; and
after determining that the common hardware component is associated with the first failing test results, determining not to execute the first test on the second DUT.


US Pat. No. 11,113,182

REVERSIBLE DEBUGGING IN A RUNTIME ENVIRONMENT

MICROSOFT TECHNOLOGY LICE...


1. A method of performing reverse execution debugging of an application, the method comprising:identifying a snapshot of application state for the application;
emulating execution of the application on a debugger virtual machine that emulates functionality of a runtime virtual machine, wherein the debugger virtual machines uses intermediate level code to emulate execution of the application on the runtime virtual machine such that at least a portion of the intermediate level code is not converted to native machine instructions and executed on the runtime virtual machine, in a forward direction from the snapshot to an end point, causing generation of emulated historical execution state at various points along the emulation of the application;
collecting the emulated historical execution state; and
using the collected emulated historical execution state, emulating reverse execution of the application by substituting the collected emulated historical execution state, when needed, to restore previous state needed as a result of emulation of reverse execution of the application.

US Pat. No. 11,113,181

DEBUGGING A LIVE STREAMING APPLICATION

INTERNATIONAL BUSINESS MA...


1. A method comprising:connecting to a processing element of a remotely deployed and live streaming application executed by a first data processing system, the processing element containing at least a first operator that processes at least one tuple;
hooking at least one processing thread of the live streaming application used for execution of the processing element;
as the live streaming application is executed, without slowing or modifying data flow of the live streaming application execution to client devices, receiving a copy of the tuple and a memory dump of first state data for a state of the first operator while operating on the tuple, and tracking the tuple through a call graph comprising a plurality of nodes and a plurality of edges, each node representing a respective operator, and each edge connecting a respective pair of the plurality of nodes and representing a function call between the respective pair of the plurality of nodes;
in a debugger hosted on a second data processing system that is remote to the first data processing system, loading, using a processor, the first state data for the state of the first operator into a local instance of the first operator loaded into the debugger by moving or copying the first state data into at least a first location in memory used by the local instance of the first operator;
presenting, by the debugger, to a user at least a portion of the call graph comprising the plurality of nodes and the plurality of edges, and indicating to the user a flow of the tuple through at least the portion of the call graph based on the state data for the first operator;
receiving, by the debugger, at least a first user input changing the tuple or the state data for the first operator; and
receiving, by the debugger, at least a second user input initiating the first operator to perform at least a first operation on the tuple as changed by the first user input or using the state data for the first operator as changed by the first user input, wherein the debugger is configured for the user to inspect a state of the first operator resulting from the at least the first operation performed on the tuple by the first operator in response to the second user input.

US Pat. No. 11,113,180

EFFICIENTLY TRACKING CODE LOCATION OF RUN-TIME EVENTS IN SYSTEM SOFTWARE

salesforce.com, inc., Sa...


1. A method for tracking runtime events comprising:receiving, by a database system, an encoded identifier function call as a parameter for a first function included in at least one file in a plurality of files of a source code base;
generating, by the database system, a filename index number for each respective file of the source code base during compilation of the source code base;
returning, by the database system, an encoded identifier generated by the encoded identifier function call during compilation of the plurality of files of the source code base;
decoding, by the database system, the encoded identifier to trace back to a location of the first function in the source code base in response to receiving a runtime event from execution of the source code base; and
storing, by the database system, each returned unique encoded identifier in pre-allocated storage memory associated with the source code base.

US Pat. No. 11,113,179

INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND COMPUTER READABLE MEDIUM FOR A TRACE PROCESS

MITSUBISHI ELECTRIC CORPO...


1. An information processing device that is implemented when an electronic computer executes middleware, the information processing device comprising:a processor; and
a memory to store the middleware which, when executed by the processor, performs processes of:
performing communication with an external device according to an instruction from application software installed on the electronic computer; and
executing a first information trace process when a first condition that is predetermined is satisfied and executing a second information trace process when a second condition that is predetermined is satisfied, the first information trace process including obtaining, from an operating system installed on the electronic computer, environmental information that is information about an operating environment of the application software and writing the environmental information to an environmental information log file, the second information trace process including writing, to a communication log file, information indicating a procedure of communication performed with the external device, obtaining the environmental information from the operating system, and writing the environmental information to the environmental information log file, wherein
the processor determines that the first condition is satisfied when communication is performed as many times as a predetermined count after previous execution of the first information trace process, and
the processor determines that the second condition is satisfied when communication between the processor and the external device fails.

US Pat. No. 11,113,178

EXPOSING AND REPRODUCING SOFTWARE RACE CONDITIONS

EMC IP Holding Company LL...


1. A system, comprising:a processor; and
a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations comprising:
identifying a synchronization mechanism of a grouping of operating system synchronization mechanisms;
based on a tunable probability value, representing a probability of a conflict occurring between a first execution of the synchronization mechanism and a second execution of the synchronization mechanism, and a semaphore used to reduce recursion associated with the synchronization mechanism, increasing a duration of a race window associated with the synchronization mechanism, wherein the race window is increased by a delay period, wherein the race window operates in collaboration with the synchronization mechanism, wherein the tunable probability value further represents a first time duration prior to the first execution of the synchronization mechanism and a second time duration prior to the second execution of the synchronization mechanism, and wherein the first time duration differs from the second time duration; and
based on the race window having been increased and the delay period, increasing a likelihood of revealing a race condition.

US Pat. No. 11,113,177

SECURELY DEBUGGING DIFFERENT APPLICATIONS IN A SINGLE SHORT-LIVED CONTAINER

TRACELINK, INC., North R...


1. A method for securely debugging multiple different application instances in a single short-lived container, the method comprising:containerizing a multiplicity of different application instances into a single short-lived container in a containerized environment;
additionally containerizing a debug server in the single short-lived container and authenticating the debug server within the containerized environment;
establishing a communicative link between the debug server and a debug client executing remotely from the single short-lived container;
proxying debug directives from the debug client through the debug server to selected ones of the different application instances;
authenticating an end user of the debug client externally to the containerized environment and permitting the proxying only upon authentication of the end user of the debug client, and without further need for the end user of the debug client to authenticate within the containerized environment; and,responding to the authentication of the end user of the debug client externally to the containerized environment, by:
identifying a set of the different application instances that are permitted to be debugged by the end user,
generating a configuration file specifying the set, and
transmitting the configuration file to the debug server for use by the debug server in limiting the proxying of the debug directives on behalf of the end user only in respect to the application instances specified in the set in the configuration file.


US Pat. No. 11,113,176

GENERATING A DEBUGGING NETWORK FOR A SYNCHRONOUS DIGITAL CIRCUIT DURING COMPILATION OF PROGRAM SOURCE CODE

Microsoft Technology Lice...


1. A computer-implemented method for generating and debugging synchronous digital circuits, comprising:storing source code in a multi-threaded imperative programming language;
compiling the source code in the multi-threaded imperative programming language into a circuit description for a synchronous digital circuit, wherein the circuit description comprises data defining a debugging network connected to a plurality of pipelines;
automatically generating, by a central processing unit (CPU) connected to the synchronous digital circuit, a debugging request to query the plurality of pipelines for state information by way of the debugging network; and
providing the debugging request to the debugging network to query the plurality of pipelines for state information, wherein the debugging request is provided automatically in response to determining that a predetermined time period has elapsed.

US Pat. No. 11,113,175

SYSTEM FOR DISCOVERING SEMANTIC RELATIONSHIPS IN COMPUTER PROGRAMS

THE ULTIMATE SOFTWARE GRO...


1. A method comprising:analyzing, for a semantic relationship discovery process, information provided by a source, wherein the information is associated with an application under evaluation by a system and is actively extracted from interactions conducted with the application under evaluation while the application under evaluation is under evaluation by the system;
determining, based on the analyzing of the information provided by the source, a concept associated with data elements in the information, a relationship between the data elements in the information, a grouping associated with the data elements in the information, or a combination thereof;
generating, based on the analyzing of the information, a constraint suggestion for the application under evaluation;
generating, based on the constraint suggestion and by utilizing instructions from a memory that are executed by a processor of the system, a hypothesis associated with the concept, the relationship, the grouping, or a combination thereof, wherein the hypothesis is ranked relative to other hypotheses generated by the system based on a confidence level of the hypothesis and confidence levels of the other hypotheses to form a ranked plurality of hypotheses;
filtering, by applying a confidence level threshold to the ranked plurality of hypotheses, a subset of hypotheses from the ranked plurality of hypotheses that satisfy the confidence level threshold;
outputting the subset of hypotheses satisfying the confidence level threshold:
validating the hypothesis, the other hypotheses, the subset of hypotheses, or a combination thereof, by testing the application under evaluation and observing outputs generated based on the testing; and
training, based on the validating of the hypothesis, the other hypotheses, the subset of hypotheses, or a combination thereof, and based on a confirmation or a rejection of the hypothesis, the other hypotheses, the subset of hypotheses, or a combination thereof, a model to enhance the determination of the concept, the relationship, the grouping, or a combination thereof, for a subsequent semantic relationship discovery process.

US Pat. No. 11,113,174

METHODS AND SYSTEMS THAT IDENTIFY DIMENSIONS RELATED TO ANOMALIES IN SYSTEM COMPONENTS OF DISTRIBUTED COMPUTER SYSTEMS USING TRACES, METRICS, AND COMPONENT-ASSOCIATED ATTRIBUTE VALUES

VMware, Inc., Palo Alto,...


1. A system that determines relevant attribute dimensions correlated with anomalous operational behaviors of components of a distributed computer system, the system comprising:one or more processors;
one or more memories; and
computer instructions, stored in one or more of the one or more memories that, when executed by one or more of the one or more processors, control the system tocollect metric data comprising a series of timestamped metric values associated with each metric of multiple metrics, wherein each metric of the multiple metrics is associated with a component or component type of the distributed computer system,
identify components of the distributed computer system which exhibit anomalous operational behaviors using the collected metric data,
access collected call traces from a call-tracing service,
access attribute values for selected components of the distributed computer system,
employ decision-tree-based analyses to determine relevant attribute dimensions of component types that are correlated with the identified components of the distributed computer system which exhibit anomalous operational behaviors, and
transmit the determined relevant attribute dimensions of the component types to a computational entity to facilitate amelioration of the anomalous operational behaviors.


US Pat. No. 11,113,173

SYSTEMS AND METHODS FOR DETECTING, ANALYZING, AND EVALUATING INTERACTION PATHS

Rovi Guides, Inc., San J...


1. A method for generating interaction path details from a plurality of user interactions, the method comprising:retrieving a time threshold, wherein the time threshold is an amount of time used in determining whether two consecutive interactions are in one interaction path;
retrieving, from memory, a plurality of user interaction records, wherein each user interaction record comprises a timestamp and wherein the plurality of user interaction records correspond to interactions of a plurality of users with a content delivery platform across a plurality of devices;
sorting the plurality of user interaction records based on the timestamp in each user interaction record;
identifying a path-start record from the plurality of user interaction records, wherein the difference between the timestamp in the path-start record and the timestamp of a user interaction record immediately before the path-start record exceeds the time threshold;
identifying a path-end record from the plurality of user interaction records, wherein the difference between the timestamp in the path-end record and the timestamp of a user interaction record immediately after the path-end record exceeds the time threshold;
creating a first interaction path record comprising the path-start record, the path-end record, and a plurality of user interaction records between the path-start record and the path-end record;
storing, in the memory, the first interaction path record;
identifying, based on the first interaction path record, a second interaction path record;
determining, based on a first timestamp corresponding to the first interaction path path-end record and a second timestamp corresponding to the second interaction path path-start record, an optimal time threshold;
creating, based on the optimal time threshold, a candidate interaction path; and
generating, for display, a user interface to display details of the first interaction path record, the second interaction path record, and the candidate interaction path, wherein the details comprise respective summary statistics for each respective path.

US Pat. No. 11,113,172

METHOD, TERMINAL, AND COMPUTER-READABLE STORAGE MEDIUM FOR DISPLAYING ACTIVITY RECORD INFORMATION

Beijing Xiaomi Mobile Sof...


1. A method for displaying activity record information, the method applicable to a mobile phone comprising a processor, the mobile phone terminal having a plurality of applications for performing activities installed therein, the method comprising:in response to switching to a specified interface in the mobile phone, configuring the processor to extract and integrate activity record information of all applications of the plurality of applications in an activity category to acquire specified activity record information in the activity category, wherein the activity category is determined according to a user selection; and
displaying the specified activity record information in the activity category determined by the user selection in the specified interface in the mobile phone, wherein the specified interface is a hiboard interface; and
wherein the specified activity record information includes a money transaction value, a money transaction time, or a money transaction name, and the specified activity record information is obtained by statistics for at least two pieces of activity record information during a specified period of time.

US Pat. No. 11,113,171

EARLY-CONVERGENCE DETECTION FOR ONLINE RESOURCE ALLOCATION POLICIES FOR ITERATIVE WORKLOADS

EMC IP Holding Company LL...


1. A method, comprising:obtaining a dynamic system model based on a relation between an amount of at least one resource for a plurality of workloads in a controlled workload list and at least one predefined service metric, wherein the plurality of workloads in the controlled workload list participate in an adaptation cycle;
obtaining an instantaneous value of the at least one predefined service metric;
obtaining an adjustment to the amount of the at least one resource for a given one of the plurality of workloads in the controlled workload list based at least in part on a difference between the instantaneous value of the at least one predefined service metric and a target value for the at least one predefined service metric;
determining whether the given one of the plurality of workloads has converged based on an evaluation of one or more predefined convergence criteria;
removing the given one of the plurality of workloads from the controlled workload list when the given one of the plurality of workloads has converged; and
initiating an application of the determined adjustment to the amount of the at least one resource to the given one of the plurality of workloads,
wherein the method is performed by at least one processing device comprising a processor coupled to a memory.

US Pat. No. 11,113,170

TECHNOLOGIES FOR MANAGING MEMORY ON COMPUTE DEVICE

Intel Corporation, Santa...


1. A compute device for managing memory use on the compute device, the compute device comprising:an interface; and
low memory application killer circuitry to:determine a current combination of applications running on the compute device;
retrieve, from a database of the compute device, one or more entries of a plurality of entries of the database, wherein each entry of the plurality of entries is associated with a combination of applications of a plurality of combinations of applications and includes an indication of a quality of a user experience associated with the corresponding combination of applications;
determine an expected quality of a user experience associated with the current combination of applications based on the one or more indications of the quality of the user experiences associated with the one or more entries; and
kill one or more of the current combination of applications based on the expected quality of the user experience associated with the current combination of applications.


US Pat. No. 11,113,169

AUTOMATIC CREATION OF BEST KNOWN CONFIGURATIONS

Dell Products L.P., Roun...


1. A method for automatically generating a best known configuration for a platform, the method comprising:receiving, by a best known configuration engine and from a first set of end user devices that have the platform, health reports pertaining to a first driver or firmware that is installed on the first set of end user devices, each health report including performance information of the first driver or firmware on the corresponding end user device;
evaluating, by the best known configuration engine, the performance information of the first driver or firmware that is included in the health reports;
based on the evaluation, determining that the first driver or firmware is functioning properly on the first set of end user devices;
based on the determination, including the first driver or firmware in the best known configuration for the platform; and
publishing the best known configuration for the platform.

US Pat. No. 11,113,168

DISTRIBUTED ARCHITECTURE FOR FAULT MONITORING

University of Connecticut...


1. A distributed architecture system for detecting an anomaly in a power semiconductor device, the system comprising:a server computing device; and
one or more local components communicatively coupled to the server computing device and remote from the server computing device, each one of the one or more local components comprising one or more sensors positioned adjacent to the power semiconductor device for sensing properties of the power semiconductor device comprising a device cycling current, a change in device temperature, a normalized junction-to-ambient thermal resistance, a power step, a device maximum junction temperature, a device minimum junction temperature, a Vcold measurement, a Vhot measurement, and a Von measurement,
wherein:each one of the one or more local components:receives sensed data corresponding to the properties,
designates a first portion of the sensed data as testing data and designates a second portion of the sensed data as training data, and
transmits the training data to the server computing device,

the server computing device:utilizes the training data, via one or more of a machine learning algorithm, a fault diagnostic algorithm, and a fault prognostic algorithm, to generate a set of eigenvalues and associated eigenvectors based on the properties, and
selects a selected set of eigenvalues and associated eigenvectors, and

the processing device of the one or more local components conducts a statistical analysis of the selected set of eigenvalues and associated eigenvectors to determine that the testing data is indicative of the anomaly.


US Pat. No. 11,113,167

SYSTEM TESTING INFRASTRUCTURE WITH HIDDEN VARIABLE, HIDDEN ATTRIBUTE, AND HIDDEN VALUE DETECTION

INTERNATIONAL BUSINESS MA...


1. A method for detecting and localizing a fault when testing a system under test (SUT), the method comprising:modeling inputs to the SUT as a collection of attribute-value pairs;
generating an initial set of test vectors that provides complete n-wise coverage of a test space represented by the attribute-value pairs;
generating a set of testcases from the initial set of test vectors using combinatorics test design;
executing the set of testcases to obtain a set of execution results, the execution results being in binary form indicative that a testcase succeeded or failed, the set of testcases executed a plurality of times;
updating, for each execution of the set of testcases, for each testcase, a non-binary success rate (ST) based on the set of execution results;
in response to a first success rate corresponding to a particular testcase being below a predetermined threshold:generating a second set of testcases based on the test vectors, the second set of testcases generated using inverse combinatorics test design;
executing the second set of testcases to obtain a second set of execution results using a second set of test vectors, the second set of testcases executed at least a predetermined number of times; and
updating, for each execution of the second set of testcases, for each testcase, a second success rate (ST?) based on the second set of execution results; and
in response to the second success rate corresponding to the particular testcase being within a predetermined threshold of the first success rate, notifying a user of a defect in the modeling of the inputs to the SUT.