Patent classifications
G06F16/2458
MEMORY DEVICE THAT IS OPTIMIZED FOR LOW POWER OPERATION
A storage device that includes a non-volatile memory is provided. The non-volatile memory includes a control circuitry that is communicatively coupled to a memory block that includes memory cells arranged word lines. The control circuitry is configured to program the memory cells of a selected word line in a plurality of programming loops to store a single bit of data in each memory cell of the selected word line. The programming loops include programming operations and verify operations. The programming operations include applying a programming voltage to the selected word line, and the verify operations include applying a verify voltage to the selected word line. At least one programming loop of the plurality of programming loops further includes a pre-verify operation. The pre-verify operation includes applying a pre-read voltage to the selected word line. The pre-read voltage is less than the verify voltage.
SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS
The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.
RECORD MATCHING MODEL USING DEEP LEARNING FOR IMPROVED SCALABILITY AND ADAPTABILITY
Systems and methods are described for linking records from different databases. A search may be performed for each record of a received record set for similar records based on having similar field values. Recommended records of the record set may be assigned with the identified similar records to sub-groups. Pairs of records may be formed for each record of the sub-group, and comparative and identifying features may be extracted from each field of the pairs of records. Then, a trained model may be applied to the differences to determine a similarity score. Cluster identifiers may be applied to records within each sub-group having similarity scores greater than a predetermined threshold. In response to a query for a requested record, all records having the same cluster identifier may be output on a graphical interface, allowing users to observe linked records for a person in the different databases.
RECORD MATCHING MODEL USING DEEP LEARNING FOR IMPROVED SCALABILITY AND ADAPTABILITY
Systems and methods are described for linking records from different databases. A search may be performed for each record of a received record set for similar records based on having similar field values. Recommended records of the record set may be assigned with the identified similar records to sub-groups. Pairs of records may be formed for each record of the sub-group, and comparative and identifying features may be extracted from each field of the pairs of records. Then, a trained model may be applied to the differences to determine a similarity score. Cluster identifiers may be applied to records within each sub-group having similarity scores greater than a predetermined threshold. In response to a query for a requested record, all records having the same cluster identifier may be output on a graphical interface, allowing users to observe linked records for a person in the different databases.
RESOURCE PROVISIONING SYSTEMS AND METHODS
A method for a first set of processors and a second set of processors comprises, the first set of processors processing a set of queries, as a result of a change in utilization of the first set of processors, processing the set of queries using the second set of processors. The change in processors is independent of a change in storage resources, the storage resources shared by the first set of processors and the second set of processors.
INFORMATION LINKING SYSTEM, INFORMATION LINKING METHOD, AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM
An information coordinating system includes a processor and a memory configured to store a program, the program being executed by the processor to cause the processor to acquire first system data transmitted from a first system server and second system data transmitted from the second system server, the first system data including a first identifier and a first data format associated with a first identifier, and the second system data including a second identifier, first and a second sub-data having a second data format associated with the second identifier, convert the first sub-data of the second system data to the first identifier, and convert the data format of the first and second system data to a common data format, and generate first statistical data and second statistical data by statistically processing.
Systems, apparatuses, and methods for request throttling
Techniques for request throttling in a provider network environment are described. A throttle handler controls whether requests will be processed through maintaining a token-based record, per type of request, having a token value indicative of a number of requests that can be processed over a time period. For a request, the token value of the token-based record corresponding to the request type is updated based on calculating an elapsed time between a last update time of the token-based record and the current time, calculating an intermediate token value as the existing token value plus a value of the elapsed time multiplied by a rate, and updating the token value to be the minimum between the intermediate token value and a burst value. The request is serviced when the updated token value is determined to be greater than or equal to a number of tokens needed to perform the request.
Identity security architecture systems and methods
Embodiments of various systems and methods described herein provide an identity security database analytics system which is configured to provide security alerts to a user. The security alerts can include for personalized metrics related to potential identity theft incidents. The personalized metrics can include user specific information on security breaches of the user's personal information as well as depersonalized statistics generated based on information of other users having one or more similar characteristics of the user.
Data query method and apparatus
This disclosure provides a data query method and apparatus. The method includes: dividing an object storage system into a plurality of storage spaces based on time slices, establishing a mapping relationship between the storage spaces, the time slices, and operation records, recording time slice information corresponding to a snapshot after generating the snapshot, and implementing services such as a read-only service, a snapshot rollback service, and an object change service based on the snapshot, so as to improve query performance without adding extra storage overheads.
System of visualizing and querying data using data-pearls
A system and method for visualizing and querying high dimensional data to a user. The system includes a user device, a data-pearls visualization and querying server. The server obtains the high dimensional data from the user device associated with user. The server generates data clusters and sub-divides the data clusters into non-overlapping subsets of data-pearls using a clustering technique. The server selects a shape for each data-pearl by comparing a distance between centroid of a data-pearl and a farthest point from a determined centroid using L.sub.p norm distance measures. The server configures each data-pearl in a three-dimensional plot. The server enables the user to visualize the data-pearls on a screen of the user device. The server queries data based on a query using data dimension technique. The server dimensions data related to the query through determined classifiers based on filtered data after pruning unrelated data to the query.