Abstract: Techniques are provided for implementing a distributed hierarchical cluster management system. A system comprises a data storage system and a cluster management system. The data storage system comprises a cluster of storage nodes that is partitioned into a plurality of subclusters of storage nodes. The cluster management system is deployed on at least some of the storage nodes of the data storage system, and comprises a global management system and a plurality of local management subsystems. Each local management subsystem is configured to manage a respective subcluster of the plurality of subclusters of storage nodes, and communicate with the global management system to provide subcluster status information to the global management system regarding a current state and configuration of the respective subcluster of storage nodes. The global management system is configured to manage the cluster of storage nodes using the subcluster status information provided by the local management subsystems.

Abstract: A metadata-based information system presents a metadata-based storage and display of system or user data, information management including expedited information storage, organization, search, retrieval, delivery or presentation of data in a multi-platform environment.

Abstract: Disclosed are an apparatus and method for evaluating the degradation of a display panel, for evaluating a degradation state of a display panel, such as mura. The method of evaluating the degradation of a display panel may be implemented by generating mutual information by using a first histogram distribution vector of a reference frame having a target grayscale level and a second histogram distribution vector of an evaluation frame displayed on a display panel in response to the target grayscale level, generating normalized mutual information of the mutual information, providing a weight into which a cognitive characteristic of a distribution of grayscales of pixels of the evaluation frame is incorporated, and outputting an evaluation value obtained by multiplying the normalized mutual information and the weight.

Abstract: The present disclosure relates to merging database tables. Systems and methods may involve performing a comparison between the first set of records and the second set of records and identifying a plurality of record pairs based on the comparison. Each record pair may comprise a record in the first set of records and a record in the second set of records. In addition, A feature signature may be generated for each record pair by comparing field values in each record pair. The feature signature may be classified to identify at least one related record pair. A merged database table may be generated such that it comprises the at least one related record pair and comprises a set of unique records among selected from the first set of records and the second set of records.

Abstract: This application provides a trace chain information query method, including: receiving, by a trace chain server, first trace chain information sent by a first service node and second trace chain information sent by a second service node, where the first service node is a service node in a first trace chain, the second service node is a service node in a second trace chain, both the first trace chain and the second trace chain are generated as triggered by a same user operation, the first trace chain information includes a group identifier, the second trace chain information includes the group identifier, and the group identifier is used to indicate the user operation; and finding, by the trace chain server, the first trace chain information and the second trace chain information based on the group identifier.

Abstract: This document describes a non-transitory computer readable media programmed to enrich an entered record submitted to be matched with a dataset record stored on a data storage device. The enrichment is done by supplementing data in the entered record with customer data from a dataset. The media is further programmed to search through a plurality of dataset records in the dataset for the entered record. The search is programmed to first determine if the entered record unambiguously matches one of the dataset records or if the entered record unambiguously does not match one of the dataset records. If the entered record does not unambiguously match one of the dataset records, score match characteristics using a Fellegi-Sunter algorithm, save the score as a highest score if the score is above the highest score less a threshold, and save a location of one of the dataset records as a matching record if the score is above a previous highest score.

Abstract: Systems, methods, and other embodiments associated with detecting severity levels of risk in an electronic correspondence are described. In one embodiment, a method includes inputting, into a memory, a target electronic correspondence that has been classified as being litigious by a machine learning classifier. An artificial intelligence rule-based technique is applied to the target electronic correspondence that identifies high and medium risk level keywords. The technique is also configured to generate a litigious score based on a sum of term frequencies-inverse document frequencies using the remaining keywords. An electronic notice is transmitted to a remote computer over a communication network that identifies the target electronic correspondence and the level of litigation risk.

Abstract: A system and method for determining a candidate workflow from a cluster of similar workflows is presented. The process uses the differences classified as insertions of operators, deletions of operators, transpositions of operators and operator shifting in a parallel workflow to determine similarities in the workflow cluster and extract a candidate similar to the workflow in the comparison query. The extracted candidate workflow can then be used to suggest modifications to the workflow in the comparison query.

Abstract: A system and method are disclosed for generating an assortment plan by an assortment planner. The assortment planner stores value metrics for two or more products, each of the products including two or more of attributes. The assortment planner also analyzes the two or more attributes, by generating attribute values for each of the two or more attributes and communicates the attribute values for each of the two or more attributes to a planning engine. The assortment planner also further constructs a product attributes table and a value metrics table, duplicates the attribute values to generate a merged product attributes table including a number of duplicates of the attribute values and generates a binary value table for each of the attribute values, one or more itemsets, and an assortment of products based, at least in part, on the one or more itemsets. Other embodiments are also disclosed.

Abstract: A computer-implemented method includes receiving, at a computer system, a question; identifying one or more first semantic elements in the question; selecting, from one or more electronic documents, a plurality of candidate responses to the question based on comparison of the one or more first semantic elements to second semantic elements; determining completeness scores for the plurality of candidate responses, wherein each of the completeness scores indicates how completely a corresponding candidate response from the plurality of candidate responses answers the question; determining relevance scores for the plurality of candidate responses, wherein each of the relevance scores indicates how relevant a corresponding candidate response from the plurality of candidate responses is to the question; and providing, by the computer system, at least a portion of the plurality of candidate responses based, at least in part, on the completeness scores and the relevance scores.

Abstract: Random cut trees are generated with respective to respective samples of a baseline set of data records of a data set for which outlier detection is to be performed. To construct a particular random cut tree, an iterative splitting technique is used, in which the attribute along which a given set of data records is split is selected based on its value range. With respect to a newly-received data record of the stream, an outlier score is determined based at least partly on a potential insertion location of a node representing the data record in a particular random cut tree, without necessarily modifying the random cut tree.

Abstract: The systems and methods of a blockchain platform for distributed applications includes flexibility to implement a variety of client systems with a token usage and distributed computing based on separation of roles for a miner and a blobber. The message flow model between different parties including a client, a blobber and a miner allows for fast transactions on a lightweight blockchain by lightening the load on a mining network, i.e. a network of one or more miners. Offloading the work to a different group of machines allows for greater specialization in the design and specifications of the machines, allowing for the blockchain platform miners to be optimized for fast transaction handling and blockchain platform blobbers to be efficient at handling data for given transaction types.

Abstract: A metadata synchronization system is provided. The metadata synchronization system may include a plurality of metadata elements included in a plurality of applications. The plurality of applications may be coupled to a plurality of application hubs. The plurality of application hubs may be coupled to a federated metadata repository. The plurality of application hubs may be coupled to a governed metadata repository. The system may include crawling the plurality of applications, the plurality of application hubs, the federated metadata repository and the governed metadata repository to ensure that the metadata elements are synchronized across all of the components. In the event that a metadata element is not synchronized across any one of the components, the system may notify interested parties and/or resolve the discrepancy.

Abstract: Hardware accelerators and methods for out-of-order processing are described. In one embodiment, a processor includes a hardware accelerator having a plurality of processing elements coupled to form a plurality of logical rows of a multidimensional processing array and a plurality of logical columns of the multidimensional processing array, wherein a processing element of the plurality of processing elements includes a switch to selectively source, from either of an output for a first dataset from an upstream processing element of the plurality of processing elements or a boundary condition value for a second dataset stored in the processing element, based on a switch control value provided to the processing element; and a core coupled to the hardware accelerator.

Abstract: The following disclosure provides a system that filters and batches changes to improve communication between an application and an add-in. In some embodiments, the application batches a threshold number of changes made to a section of content. Using a threshold regulates the rate of updates to the add-in. In some embodiments, changes can be filtered based on the type of change (e.g. text changes, style changes, etc.) or the type of input that caused the change (e.g. keyboard input, cut and paste command, etc.). Filtering changes can reduce traffic between the application and the add-in, preventing the add-in from being overwhelmed and improving application responsiveness.

Abstract: The present invention provides for a system and a method for translating a legacy source code to a cloud native code. The present invention provides for receiving a source code and deriving a plurality of queries from the source code and the queries comprise a plurality of tokens. The present invention provides for constructing an abstract syntax tree in the form of a data structure from the tokens. The present invention provides for traversing the abstract syntax tree, the identified pattern, the scope table and the syntax table for translation of the tokens of the abstract syntax tree into new tokens stored in the form of a cloud native abstract syntax tree. The present invention provides for concatenating the new tokens stored in the cloud native abstract syntax tree to generate a translated cloud native code to be hosted on a cloud platform.

Abstract: A memory device comprises a block of ranged content-addressable memory (RCAM) including multiple RCAM memory elements, wherein each RCAM memory element is accessed by content that includes two values; a search register configured to store a search value; and logic circuitry coupled to the multiple content-addressable memory elements and the search register. The logic circuitry is configured to: compare the search value of the search register to the two values of each of the multiple RCAM memory elements in parallel; and identify an RCAM memory element according to the comparison.

Abstract: Systems and methods for determining whether a user is part of a defined segment of all users makes use of a database of user information that includes rapidly searchable field values. Predetermined segment definitions can be evaluated using information from a user's record in the database to rapidly determine if the user is a member of the segment.

Abstract: The automatic identification of execution behavior(s) of software. This automatic identification is based on a historical analysis of execution records to identify a particular pattern that represents an execution behavior. In order to automatically identify an execution behavior present within particular software, an execution record (or perhaps multiple execution records) representing the execution of that particular software may be accessed. Based on finding the particular pattern within the execution record (or one, some, or all of the multiple execution records) representing the execution of that particular software, the computing system may automatically identify that the execution behavior is present within the software. This may dramatically assist in modifying that execution behavior.

Abstract: A device may include a first interface and a second interface. The device may also include memory containing a set of rules and representations of pre-defined violations thereof. The device may also include digital logic programmed to: (i) receive, by way of the first interface, an Ethernet frame containing Ethernet header fields and an Ethernet payload, wherein the Ethernet payload contains a payload; (ii) extract data from the Ethernet header fields, wherein the data defines a transaction that is functionally equivalent to a further transaction that is defined by the payload; (iii) apply the set of rules to the transaction, wherein doing so involves comparing fields in the data to values and concluding that the transaction does not contain any pre-defined violations; and (iv) modify the Ethernet frame to contain content based on the payload, and transmit the Ethernet frame out the second interface.

Abstract: A computer-implemented method of fraud protection is described. A server may receive one or more keywords and a likelihood of fraud from an external source. The server may receive an image of a document from a user device, wherein the document comprises at least one of a written communication or a printed communication. The server may extract text from the image of the document, compare the extracted text to the one or more stored keywords, and calculate a confidence level of fraud. The server may send an indication of the confidence level of fraud to the user device.

Abstract: Techniques for data replication from a primary system to a standby system. A first buffer portion of a transaction log buffer is allocated to a first transaction at a primary system. Upon determining that the first buffer portion is fully formed, before the log data is written to the storage on the primary system, and before the transaction log buffer is entirely full, the log data in the first buffer portion is transmitted to the standby system, from the primary system. Upon writing the log data to the storage on the primary system and after the log data in the first buffer portion is transmitted to the standby system, a notification is transmitted to the standby system, from the primary system, where the standby system is configured to process the received log data responsive to receiving the notification from the primary system.

Abstract: A communication relay includes a port configured to be connected to a terminal device, a memory that stores instructions, and a processor that executes the instructions. The instructions cause the processor to perform: referring to a communication rate at the port; measuring the communication rate; and calculating a sampling value indicating a communication state based on the measured communication rate.

Abstract: Concept expansion using tables, such as web tables, can return entities belonging to a concept based on an input of the concept and at least one seed entity that belongs to the concept. A concept expansion frontend can receive the concept and seed entity and provide them to a concept expansion framework. The concept expansion framework can expand the coverage of entities for concepts, including tail concepts, using tables by leveraging rich content signals corresponding to concept names. Such content signals can include content matching the concept that appear in captions, early headings, page titles, surrounding text, anchor text, and queries for which the page has been clicked. The concept expansion framework can use the structured entities in tables to infer exclusive tables. Such inference differs from previous label propagation methods and involves modeling a table-entity relationship. The table-entity relationship reduces semantic drift without using a reference ontology.

Abstract: Systems and methods for managing content in a flash memory. Systems and methods for implementing hash tables in a flash memory are disclosed. A hash table may include a flat array or an array of buckets that are each associated with a linked list. Adding or removing entries from the hash table or from the linked list are achieved by performing an overwrite operation where possible to pointers affected by the table operation.

Abstract: A technique is provided that reduces the number of used entries in a CAM required to store a rule. A data conversion device generates entry data which is to be compared with a search key and is stored in an associative memory that can hold three or more values. The data conversion device includes a conversion circuit for extracting a plurality of character strings from an inputted rule in accordance with a regular expression based on the regular expression and converting first and second character strings included in the character strings, respectively, into first and second bit data different from each other, and an encode circuit that compares the first bit data and the second bit data for each bit and generates entry data where each mismatch bit among a plurality of bits included in the first bit data is converted into “Don't Care” value based on a comparison result.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage media, for implementing a blockchain-based web service. One of the methods includes receiving an access request based on a short link. The short link of the access request is processed to obtain a long link corresponding to the short link. It is determined that the long link satisfies a predefined long link regular expression that is sent by a configuration server. The access request to the long link is redirected after determining that the long link satisfies the predefined long link regular expression.

Abstract: An embodiment of the invention provides a device for searching indexes for sensor tag data. The can include a memory that has sensor tag data stored as a time series; an interface that is configured to receive tag names and time segment information for searching sensor tag data; and a processor that is configured to determine partitions of the memory having the sensor tag data stored therein based on the time segment information and configured to determine corresponding indexes and leaf nodes for the determined partitions based on the tag names and the time segment information. An embodiment of the invention can provide an optimized index structure for and a method of storing and searching time series sensor tag data with which most query patterns relating to time series sensor tag data can be satisfied.

Abstract: Systems and techniques are disclosed for enabling structured data to be associated with visual content in a manner that preserves the ability to edit the visual content using a content application such as a notebook application. Techniques and systems enable semantic notation to be introduced into selected regions of the visual content that indicate the visual content's structured data, allowing the content to be searched and accessed more easily by common search technologies and search engines. The semantic notation is assigned to the visual content so that the introduction of the semantic notation does not hinder the user's viewing or editing of the visual content with a content application. The inclusion of the semantic notation does not cause existing visual editing tools that do not understand the semantic notation to cease to function properly.

Abstract: A method for optimized route caching includes comparing a destination address of a network packet to a first set of prefixes in a routing cache, and comparing the destination address to a second set of prefixes in a full routing table when a longest matching prefix for the destination address is not found in the routing cache. The method further includes copying the longest matching prefix and a set of sub-prefixes of the longest matching prefix from the full routing table to the routing cache, and forwarding the network packet.

Abstract: Systems and methods for multiple updates to a database using paths is disclosed. Updates to a graph database can be performed by associating an attribute node, that stores the updated value, to the entity node to-be updated. When the entity node is queried for the value, the nearest attribute node is identified using a shortest path determination.

Abstract: The implementation of an automated agent for data copy verification. Specifically, the implementation entails the execution of an intelligent, machine-learning based method and system for determining the integrity of data copies (i.e., for identifying whether data copies of a same data set have been impacted by malicious activities). Upon determining that data integrity is likely compromised, one or more corrective actions may be triggered. These actions may mitigate the spread of corruption and/or infection.

Abstract: Embodiments of the invention are directed to systems and methods for authentication using audio filtering. In some embodiments, an original audio segment such as a voice segment may be received. The received original audio segment may be modified using a first predetermined algorithm. The modified audio segment may be sent to an authentication server. At the authentication server, the modified audio segment may be reconstructed into the original audio segment using a second predetermined algorithm. The client device may be authenticated for a transaction based at least in part on the reconstructed original audio segment.

Abstract: A data search system is configured to: generate a first data set including a plurality of records, in which a first column is used as a reference column, and clustering is performed for each predetermined range of the first column to generate first clusters; generate a second data set including the plurality of records, in which a second column is used as the reference column, and clustering is performed for each predetermined range of the second column to generate second clusters; cause a memory device to store therein the first date set and the second data set; generate index information in which information indicating the reference column, information indicating the predetermined range, and a memory area of the clusters are associated with each other; read out the cluster from the memory device based on the index information; and extract data matching the search condition from the read cluster.

Abstract: A storage device is provided with memory configured to store user authentication data for accessing an operating system executing on a host computer. A processor is provided to receive a command indicating readiness to accept input from the operating system, and to retrieve the user authentication data from the memory in response to the command.

Abstract: Recipient verification converses computation resources, reduces network bandwidth and reduces the amount of user input required for generating email messages that include personal salutations that are matched to the recipient's proper title, style, or honorific. The email addresses are associated with a number of recipients, gender-specific markers in names within a salutation, internal and external data sources using the email addresses (e.g., an enterprise contact server, a social network), and historical salutations to determine whether the salutation in an email message is correct for a given recipient or group of recipients. In response to detecting that the sender has not used an appropriate salutation, recipient verification is operable to suggest an appropriate salutation to a user for approval, or to automatically substitute an appropriate salutation for an inappropriate salutation in various aspects.

Abstract: Method and system for cleansing and de-duplicating data in database are provided. The method includes filtering garbage records from a plurality of records based on data fields, and applying cleansing rules to create a cleansed database. A similarity vector is generated, where each vector corresponds to pairwise comparison of distinct data entries in cleansed database. Matching rules are applied to label each vector as one of matched, unmatched and unclassified. The method analyzes the vectors labeled as matched and unmatched to train a machine learning model to identify duplicates in the cleansed database. Unclassified vectors in the cleansed database are labeled as matched or unmatched by applying machine learning model on unclassified vectors. Thereafter, the method processes all the vectors labeled as matched to create clusters of records that are duplicates of each other. Further, records in each cluster are merged to obtain de-duplicated cleansed database using predefined consolidated rules.

Abstract: A computing device is provided comprising a processor configured to select at least one pair of elements, including an element in a source column of the first table and an element in a target column of the second table. The processor may detect that the elements are in different formats. For at least one element, the processor may apply a predetermined mapping to a common format. The processor may modify at least one element to have the same format as the other, and may generate an example including the modified pair. The processor may programmatically generate a script that, when performed on the selected elements, produces a value consistent with the example. For the script with output matching the elements of the target column, the processor may convey the output for display, and may join the tables at least in part by performing the script on the source column.

Abstract: The disclosure relates to technology for mining data in a database by recursively mining a conditional frequent pattern tree (FP-tree) for frequent items of each conditional pattern base for each node in an FP-tree to obtain frequent patterns. For each branch in the FP-tree, a single-item node table (NT) is generated for which a selected one of the frequent items appears in the node of the branch. The single-item NT including a list of all of the frequent items appearing in the FP-tree and a corresponding frequent item count. For each single-item NT of each branch generated for the selected one of the frequent items, the frequent item count of each frequent item is summed in the single-item NT formed for each branch to generate a combined single-item NT, and association rules based on the frequent patterns are generated for each of the frequent items and the combined single-item NT.

Abstract: An improved method for assessing rapport and potential compatibility between two or more persons, including collecting a sample profile of the brain wave patterns of each person, analyzing the profiles and comparing the characteristics of each profile with the profile or profiles of other individuals according to predetermined criteria.

Abstract: Methods and systems for managing for migrating feedback data from one digital asset to another digital asset are disclosed. Typically, the one digital asset is available for distribution from a network-based media distribution system, but then subsequently is removed from distribution for any of a number of reasons. However, since the one digital asset has been in use at the network-based media distribution system, it has accumulated feedback data. Hence, if the another digital asset serves (e.g., due to equivalency) to replace the one digital asset, then the accumulated feedback data from the one digital asset can be transferred to the another digital asset. As a result, the another digital asset can benefit from the feedback data that was previously associated with the one digital assert.

Abstract: The present invention relates to document automation/assembly systems, and more particularly to document automation systems distributed over a network such as the Internet, and/or other communication networks. In addition, the present invention relates to methods, especially computer-implemented methods, to computer programs, and to recording media storing such programs for use in such systems.

Abstract: The present disclosure relates to a computer-implemented method for use in an electronic design environment. Embodiments may include defining, using at least one processor, a grammar object system including one or more of objects, elements, values and relationships. Embodiments may include generating a technology grammar binary representation, based upon, at least in part, the grammar object system and receiving a technology ASCII representation. Embodiments may further include parsing at least one of the technology grammar binary representation and the technology ASCII representation to generate a technology binary representation and providing the technology binary representation to at least one of a graphical user interface or a database.

Abstract: Key values can be defined at design time (e.g. in a DTTI object) using character strings that include wildcard characters that define multi-dimensional key ranges. Wildcard characters can designate that a single variable character is to be inserted or that a range from zero to multiple characters can be inserted. The use of wildcards can make checks for key intersection non-trivial. During run time, the key values to be accessed from one or more tables are evaluated, and the operation proceeds. An error can occur if the presence of one or more wildcards in two key value strings used in an aggregation operation result in an overlap such that a same record is included more than once.

Abstract: A method for generating an accelerator program is disclosed, to help increase utilization of an accelerator and increase program development efficiency. In some feasible implementations of the present invention, the method includes: obtaining an accelerator program description that is based on a state machine, where the accelerator program description includes multiple state machines separately configured to implement an application program, and the multiple state machines form a pipeline according to a data dependency in a directed acyclic graph DAG corresponding to the application program; and performing state machine splicing on the state machines in the accelerator program description by using an accelerator compilation tool, to generate an accelerator program.

Abstract: Disclosed are techniques for implementing a device with memory comprising a data table, the data table configured to store a plurality of elements in buckets, wherein each of the plurality of buckets contains a plurality of elements. The memory can further comprise an indirection table, the indirection table comprising a plurality of bucket reference storage locations and a plurality of hash reference storage locations. The device can include processing logic configured to generate a plurality of hash values using information to be inserted into the data table and locate a hash reference stored in one of the plurality of hash reference storage locations corresponding to one of the plurality of hash values. The processing logic can further locate a bucket of the plurality of buckets corresponding to the one of the plurality of hash values.

Abstract: A computing resource service provider may store user data in a distributed data storage system. The distributed data storage system may contain one or more storage partitions configured to store based at least in part on prefixes of keys contained in a key-value store, where the size of the keys may vary. The one or more storage partitions may track requests to access data where the requests include a key such that the data may be located by the service provider based at least in part on the key. When a request is received a counter associated with the prefix included in the request may be incremented, the counter may be configured to decay over time. If the counter exceeds a threshold the service provider may split the prefix associated with the counter and generate new partitions responsible for the split prefix.

Abstract: One embodiment relates to a method for obtaining, in a communication network, a routing policy indicating rules for routing requests emitted by a software module running on a client device. The method comprises sending, by the client device, a connection request to an authentication server of the communication network in order to attach the client device to the communications network- and receiving, by the client device, a connection context response from the authentication server. The context comprises an identifier of a system for managing routing rules. The software module obtains the routing policy in accordance with at least one first rule for routing to a proxy system certified by the operator of the communications network obtained by means of the identifier.

Abstract: A packet of data and a packet-identification value are transmitted to a network device having an identifier. The stored packet-identification value and the identifier are recorded. The stored packet-identification value is then increased and the process repeats. To receive data, an expected identification value is stored in association with the identifier. A packet and a packet-identification value are received from the network device. The identifier and an indication of receipt are stored. If the received value does not match the expected value for the identifier, the received value is stored. If the values match, the stored packet-identification value and identifier are recorded. If the received value exceeds the expected value, the stored packet-identification value, the identifier and the received identifier are recorded. Subsequently, the stored expected value is increased. The process repeats. Network devices and systems are described.

Abstract: In an embodiment, a method includes receiving a first status message from a first recording device. The first status message includes a first recording identifier. The method further includes determining to initiate a second recording on a particular recording device based, at least in part, on the first status message and configuration settings. In addition, the method includes initiating a second recording on the particular recording device. Furthermore, the method includes creating a second recording identifier. The method also includes storing information related to the first recording identifier and the second recording identifier in a metadata file. Additionally, the method includes transmitting a second status message for receipt by other recording devices. The second status message includes the second recording identifier.