41st week of 2021 patent applcation highlights part 39 |
Patent application number | Title | Published |
20210318949 | METHOD FOR CHECKING FILE DATA, COMPUTER DEVICE AND READABLE STORAGE MEDIUM - A method of checking file data is provided. The method includes obtaining text information of a test file. The text information of the test file is converted into vectors, thus vectors corresponding to the test file are obtained. A quality category of the test file is obtained based on the vectors corresponding to the test file. Once the test file is determined not to meet a requirement according to the quality category of the test file, a template file corresponding to the test file is provided. | 2021-10-14 |
20210318950 | SYSTEM AND METHOD FOR IMPLEMENTING A ONE TO MANY CONFIGURATION MANAGEMENT TOOL - The invention relates generally to a system and method for implementing a one to many configuration management tool using runtime injection to replace hard coded values. An embodiment of the present invention is directed to addressing configuration management challenges, enhancing software quality and improving operation performance. | 2021-10-14 |
20210318951 | Translation of Embedded Software API's for Carrying Out Software Testing - When starting the validation process of a product containing embedded software, a scripting language is usually used to write the ramp-up and validation tests. These tests must make use of the embedded APIs within the embedded software which the product runs. Using such a procedure usually requires a much-needed layer of translation between the APIs and the scripting language functions, both in the documentation aspect, and the code aspect. The present solution discloses a method for carrying out a validation process of a product that comprises embedded software, characterized in that a translation layer is automatically implemented to enable linkage between the APIs and the scripting language function, which can save time and minimize human errors while carrying out the process. | 2021-10-14 |
20210318952 | STORAGE DEVICE AND METHOD OF OPERATING THE SAME - Provided herein may be a storage device and a method of operating the same. The storage device may include a memory device and a memory controller. The memory device may include first memory blocks and second memory blocks. The memory controller may be configured to control the memory device so that valid data stored in a victim block, among the first memory blocks, is stored in a target block, among the second memory blocks, based on a result of a comparison between an amount of valid data stored in the victim block and a reference value. Each of the first memory blocks may include memory cells each configured to store n bits, where n is a natural number of 2 or more. Each of the second memory blocks may include memory cells each configured to store m bits, where m is a natural number less than n. | 2021-10-14 |
20210318953 | METHOD FOR MANAGING FLASH MEMORY MODULE AND ASSOCIATED FLASH MEMORY CONTROLLER AND ELECTRONIC DEVICE BASED ON TIMING OF DUMMY READ OPERATIONS - The present invention provides a flash memory controller, wherein the flash memory controller is arranged to access a flash memory module, and the flash memory controller includes a ROM, a microprocessor and a timer. The ROM stores a program code, the microprocessor is configured to execute the program code to control the access of the flash memory module, and the timer is used to generate time information. In the operations of the flash memory controller, the microprocessor refers to the time information to perform dummy read operations upon at least a portion of the blocks, wherein the dummy read operations are not triggered by read commands from a host device. | 2021-10-14 |
20210318954 | COMPUTER PROGRAM PRODUCT AND METHOD AND APPARATUS FOR MANAGING GARBAGE COLLECTION PROCESS - The invention relates to a non-transitory computer program product, a method and an apparatus for managing garbage collection process. The non-transitory computer program product includes program code to: determine source blocks to be processed, wherein each source block includes an invalid page; program user data of valid pages in the source blocks, whose quantity is less than a total number of pages in one first-type physical block, into empty pages in a second-type physical block, wherein the total number of pages in one first-type physical block is greater than a total number of pages in one second-type physical block; and fill remaining empty pages in the second-type physical block with dummy values. | 2021-10-14 |
20210318955 | SYSTEM AND METHOD FOR ALLOCATING MEMORY SPACE - Embodiments of the disclosure provide systems and methods for allocating memory space in a memory device. The system can include: a memory device for providing the memory space; and a compiler component configured for: receiving a request for allocating a data array having a plurality of data elements in the memory device, wherein each of the plurality of data elements has a logical address; generating an instruction for allocating memory space for the data array in the memory device based on the request; generating device addresses for the plurality of data elements in the memory device based on logical addresses of the plurality of data elements; and allocating the memory space for the data array in the memory device based on the device addresses and the instruction. | 2021-10-14 |
20210318956 | MEMORY DEVICE INTERFACE AND METHOD - Apparatus and methods are disclosed, including memory devices and systems. Example memory devices, systems and methods include a buffer interface to translate high speed data interactions on a host interface side into slower, wider data interactions on a DRAM interface side. The slower, and wider DRAM interface may be configured to substantially match the capacity of the narrower, higher speed host interface. In some examples, the buffer interface may be configured to provide multiple sub-channel interfaces each coupled to one or more regions within the memory structure and configured to facilitate data recovery in the event of a failure of some portion of the memory structure. Selected example memory devices, systems and methods include an individual DRAM die, or one or more stacks of DRAM dies coupled to a buffer die. | 2021-10-14 |
20210318957 | MEMORY CONTROLLER, STORAGE DEVICE INCLUDING THE MEMORY CONTROLLER, AND METHOD OF OPERATING THE MEMORY CONTROLLER AND THE STORAGE DEVICE - A memory controller includes a buffer memory configured to store first meta data and second meta data having a different type from the first meta data, and a cache memory including first and second dedicated areas. The first meta data is cached in the first dedicated area and the second meta data is cached in the second dedicated area. | 2021-10-14 |
20210318958 | Cache Memory Addressing - Described apparatuses and methods order memory address portions advantageously for cache-memory addressing. An address bus can have a smaller width than a memory address. The multiple bits of the memory address can be separated into most-significant bits (MSB) and least-significant bits (LSB) portions. The LSB portion is provided to a cache first. The cache can process the LSB portion before the MSB portion is received. The cache can use index bits of the LSB portion to index into an array of memory cells and identify multiple corresponding tags. The cache can also check the corresponding tags against lower tag bits of the LSB portion. A partial match may be labeled as a predicted hit, and a partial miss may be labeled as an actual miss, which can initiate a data fetch. With the remaining tag bits from the MSB portion, the cache can confirm or refute the predicted hit. | 2021-10-14 |
20210318959 | METHOD, ELECTRONIC DEVICE AND COMPUTER PROGRAM PRODUCT FOR STORING DATA - Techniques for storing data involve estimating a hit ratio of a digest cache associated with a target storage device, the digest cache recording a digest of data that is stored in the target storage device after preprocessing; generating, according to a determination that the hit ratio is lower than a predetermined threshold, a digest for target data to be stored and performing the preprocessing; and storing, according to a determination that the digest of the target data is missing in the digest cache, the preprocessed target data in the target storage device, and recording the digest of the target data in the digest cache. Such techniques can achieve good system performance in both cases of high data repetition and low data repetition. | 2021-10-14 |
20210318960 | LOCAL CACHED DATA COHERENCY IN HOST DEVICES USING REMOTE DIRECT MEMORY ACCESS - A first host device establishes connectivity to a logical storage device of a storage system. The first host device obtains from the storage system host connectivity information identifying at least a second host device that has also established connectivity to the logical storage device, caches one or more extents of the logical storage device in a memory of the first host device, and maintains local cache metadata in the first host device regarding the one or more extents of the logical storage device cached in the memory of the first host device. In conjunction with processing of a write operation of the first host device involving at least one of the one or more cached extents of the logical storage device, the first host device invalidates corresponding entries in the local cache metadata of the first host device and in local cache metadata maintained in the second host device. | 2021-10-14 |
20210318961 | MITIGATING POOLED MEMORY CACHE MISS LATENCY WITH CACHE MISS FAULTS AND TRANSACTION ABORTS - Methods and apparatus for mitigating pooled memory cache miss latency with cache miss faults and transaction aborts. A compute platform coupled to one or more tiers of memory, such as remote pooled memory in a disaggregated environment executes memory transactions to access objects that are stored in the one or more tiers. A determination is made to whether a copy of the object is in a local cache on the platform; if it is, the object is accessed from the local cache. If the object is not in the local cache, a transaction abort may be generated if enabled for the transactions. Optionally, a cache miss page fault is generated if the object is in a cacheable region of a memory tier, and the transaction abort is not enabled. Various mechanisms are provided to determine what to do in response to a cache miss page fault, such as determining addresses for cache lines to prefetch from a memory tier storing the object(s), determining how much data to prefetch, and determining whether to perform a bulk transfer. | 2021-10-14 |
20210318962 | REVERSE SHADOW PAGE TABLES FOR FIREWALLED NESTED ENCRYPTED VIRTUAL MACHINES - Systems and methods for memory management for virtual machines. An example method may comprise running, by a host computer system, a Level 0 hypervisor managing a Level 1 virtual machine running a Level 1 hypervisor which manages a Level 2 virtual machine having encrypted memory pages. The Level 1 hypervisor may generate a shadow page table where each shadow page table entry of the plurality of shadow page table entries maps a Level 2 guest virtual address of a Level 2 address space associated with the Level 2 virtual machine to a corresponding Level 1 guest physical address of a Level 1 address space associated with the Level 1 virtual machine. The Level 0 hypervisor may generate a Level 0 page table comprising a plurality of Level 0 page table entries that maps a Level 1 guest physical address to a corresponding Level 0 host physical address. | 2021-10-14 |
20210318963 | STORAGE DEVICE AND METHOD OF OPERATING THE SAME - A storage device having improved operation speed may include a main memory configured to store first to N-th meta data, a cache memory including first to N-th dedicated areas respectively corresponding to areas in which the first to N-th meta data are stored, and a processor configured to store data accessed according to requests provided from a host among the first to N-th meta data in the first to N-th dedicated areas, respectively. A size of the first to N-th dedicated areas may be determined according to the number of times each of the first to N-th meta data is accessed by the requests. | 2021-10-14 |
20210318964 | Caching System for Eventually Consistent Services - Systems, apparatuses, and methods may provide for an eventually-consistent distributed caching mechanism for database systems. As an example, the system may include a recently updated objects (RUO) manager, which may store object identifiers of recently updated objects and RUO time-to-live values of the object identifiers. As servers read objects from the cache or write objects into the cache, the servers may also check the RUO manager to determine if the object has been updated recently enough to be at risk of being stale or outdated. If so, the servers may invalidate the object stored at the cache as it may be stale, which results in eventual consistency across the distributed database system. | 2021-10-14 |
20210318965 | PLATFORM DATA AGING FOR ADAPTIVE MEMORY SCALING - The platform data aging for adaptive memory scaling described herein provides technical solutions for technical problems facing power management for electronic device processors. Technical solutions described herein include improved processor power management based on a memory region life-cycle (e.g., short-lived, long-lived, static). In an example, a short-term memory request is allocated to a short-term memory region, and that short-term memory region is powered down upon expiration of the lifetime of all short-term memory requests on the short-term memory region. Multiple memory regions may be scaled down (e.g., shut down) or scaled up based on demands for memory capacity and bandwidth. | 2021-10-14 |
20210318966 | CRYPTOGRAPHIC PROTECTION OF MEMORY ATTACHED OVER INTERCONNECTS - Methods and apparatus relating to cryptographic protection of memory attached over interconnects are described. In an embodiment, memory stores data and a processor having execution circuitry executes an instruction to program an inline memory expansion logic and a host memory encryption logic with one or more cryptographic keys. The inline memory expansion logic encrypts the data to be written to the memory and decrypts encrypted data to be read from the memory. The memory is coupled to the processor via an interconnect endpoint of a system fabric. Other embodiments are also disclosed and claimed. | 2021-10-14 |
20210318967 | HOST DEVICE WITH AUTOMATED CONNECTIVITY PROVISIONING - A host device comprises a processor coupled to a memory. The host device is configured to obtain from a storage system connectivity information characterizing one or more ports of the storage system, and to automatically establish connectivity of a particular type between the host device and one or more logical storage devices of the storage system based at least in part on the obtained connectivity information. For example, the host device can obtain the connectivity information directly from the storage system or via at least one intermediary device such as a management station. In some embodiments, the obtaining and automatically establishing are performed by at least one multi-path input-output driver of a multi-path layer of the host device. The connectivity of a particular type illustratively comprises Internet Small Computer System Interface (iSCSI) connectivity between the host device and the storage system, although other connectivity types can be supported. | 2021-10-14 |
20210318968 | TRAINING PROCEDURE FOR RECEIVERS ASSOCIATED WITH A MEMORY DEVICE - Systems, apparatuses, and methods for training procedures on reference voltages and sampling times associated with symbols communicated with a memory device are described. The training procedures may be configured to compensate for variations that may occur in different symbols of a signal. For example, an individual training operation may be performed for each reference voltage within a first unit interval. These individual training operations may allow a reference voltage of the first unit interval to be positionable independent of other reference voltages in the same unit interval or in different unit intervals. In another example, an individual training operation may be performed for the sampling time associated with a reference voltage. These individual training operations may allow a sampling time associated with a reference voltage in the first unit interval to be positionable independent of other sampling times in the same unit interval or in different unit intervals. | 2021-10-14 |
20210318969 | MEMORY MODULE WITH REDUCED READ/WRITE TURNAROUND OVERHEAD - A memory module includes a substrate, plural memory devices, and a buffer. The plural memory devices are organized into at least one rank, each memory device having plural banks. The buffer includes a primary interface for communicating with a memory controller and a secondary interface coupled to the plural memory devices. For each bank of each rank of memory devices, the buffer includes data buffer circuitry and address buffer circuitry. The data buffer circuitry includes first storage to store write data transferred during a bank cycle interval (tRR). The address buffer circuitry includes second storage to store address information corresponding to the data stored in the first storage. | 2021-10-14 |
20210318970 | HETEROGENEOUS COMPUTING SYSTEM AND HETEROGENEOUS COMPUTING METHOD USING THE SYSTEM - A heterogeneous computing system and a heterogeneous computing method using the system are provided and capable of executing accelerating running of a video algorithm. Furthermore, the heterogeneous computing system decreases the complexity of hardware design and the use of resources by pre-processing and simple operations. Furthermore, the required time for adjusting processes of software and hardware of the heterogeneous computing system can be efficiently decreased. | 2021-10-14 |
20210318971 | ENHANCED DIRECTED SYSTEM MANAGEMENT INTERRUPT MECHANISM - An example compute node is disclosed that includes a plurality of processor cores. The example further includes an operating system (OS) having an OS power management (OSPM) engine to determine that a first of the plurality of processor cores has entered an idle state; and a system management mode (SMM) handler to detect a system management interrupt (SMI) and transition control of hardware resources of the first processor core from the OS to a basic input output system (BIOS) to enter a system management mode (SMM) in order to perform one or more platform management operations. | 2021-10-14 |
20210318972 | INTERRUPT CONTROLLER AND METHOD OF MANAGING AN INTERRUPT CONTROLLER - In accordance with an embodiment, an electronic device includes: an interrupt controller having an input for receiving a controller clock signal, and an output, the interrupt controller configured to deliver an output interrupt signal on the output when the controller clock signal is active, and a control circuit comprising, an input interface for receiving at least one interrupt signal likely to emanate from at least one item of equipment external to the device, a clock input for receiving an external clock signal, and a first controller connected to the input interface and to the clock input, the first controller configured to automatically generate the controller clock signal from the external clock signal from when the at least one interrupt signal is asserted until a delivery of a corresponding output interrupt signal. | 2021-10-14 |
20210318973 | DIRECTED INTERRUPT FOR MULTILEVEL VIRTUALIZATION - An interrupt signal is provided to a first guest operating system. A bus attachment device receives an interrupt signal from a bus connected module with an interrupt target ID identifying a processor assigned for use by the guest operating system as a target processor for handling the interrupt signal. The bus attachment device checks whether the target processor is scheduled for usage by the guest operating system. If the target processor is not scheduled for usage, the bus attachment device forwards the interrupt signal using broadcasting and updates a forwarding vector entry stored in a memory section assigned to a second guest operating system hosting the first guest operating system. The update is used for indicating to the first operating system that there is a first interrupt signal addressed to the interrupt target ID to be handled. | 2021-10-14 |
20210318974 | DYNAMIC SWITCHING METHOD - A dynamic switching method is applied to an electronic switching device. Judge whether insertion and withdrawal times between the electronic switching device and a USB cable reach a preset threshold value. Start a UART function of the electronic switching device temporarily. Judge whether an instruction of starting the UART function sent by the USB cable is received. If a recognition program unit receives the instruction of starting the UART function, the recognition program unit starts the UART function. Execute the UART function. Judge whether the electronic switching device receives an instruction of stopping the UART function. Switch to an initial status. Change a start value of a UART circuit unit into an initial value of the UART circuit unit. Charge the electronic switching device through the USB cable. | 2021-10-14 |
20210318975 | Providing I3C Communications Of Multiple Data Lines Via A Universal Serial Bus - In one embodiment, an apparatus includes: a converter to receive and convert single-ended data to differential data, and receive and convert a single-ended clock signal to a differential clock signal; a multiplexer coupled to the converter to receive the differential data and the differential clock signal; and a controller coupled to the multiplexer. In response to an indication that a device coupled to the apparatus is capable of an alternate mode, the controller is to configure the multiplexer to send the differential data on at least one of a plurality of differential pairs of data lanes. Other embodiments are described and claimed. | 2021-10-14 |
20210318976 | CHASSIS, CHASSIS MONITORING SYSTEM, AND CHASSIS MONITORING METHOD - The present disclosure provides a chassis, a chassis monitoring system, and a chassis monitoring method. The chassis includes: at least one PCIe device; a PCIe switch including an upstream bridge port for connecting with a host of an electronic device and at least one downstream bridge port for connecting with the PCIe device; a virtual endpoint, configured in the PCIe switch, for receiving the SES instruction sent by the host, causing the firmware in the PCIe switch to execute the SES instruction, and feeding back an execution result to the host after the firmware in the PCIe switch generates the execution result according to the SES instruction, the host monitors the chassis according to the execution result. | 2021-10-14 |
20210318977 | BUS PROTOCOL FOR MULTIPLE CHIPSETS - Circuits, methods, and apparatus that can allow chipsets in an electronic device to share information such that they can more efficiently utilize resources that are available in the electronic device. One example can provide a bus that is shared by three or more chipsets in an electronic device. This shared bus can be used by the chipsets in the electronic device to communicate and negotiate for the utilization of resources of the electronic device. | 2021-10-14 |
20210318978 | ETHERCAT MASTER-SLAVE STATION INTEGRATED BRIDGE CONTROLLER AND CONTROL METHOD THEREOF - An EtherCAT master-slave station integrated bridge controller, a control method, a control system and a readable storage medium are provided. Therein, an FPGA-based EtherCAT master-slave station integrated bridge controller is constructed. Because of the hardware parallel computing capability of FPGA, the master station of the EtherCAT master-slave station integrated bridge controller has a hard real-time characteristic so as to ensure real-time sending and receiving of EtherCAT network data and reduce the dependence on CPU performance and operating system real-time performance. The EtherCAT master-slave station integrated bridge controller can serve as a slave device relative to a third-party master station device and meanwhile serve as a master device relative to a third-party slave station device, thus reducing the load of EtherCAT bus network and improving the flexibility of network topology. | 2021-10-14 |
20210318979 | Adapting Transmitter Training Behavior Based Upon Assumed Identity Of Training Partner - The present disclosure generally relates to reducing time for interface transmitter training based upon an assumed identify of the training partner. It is unlikely for a drive PHY to link up with multiple PHYs per power cycle. Therefore, it is a fair assumption that when there is no power loss, the drive PHY is connected to the same host device. The drive can therefore change its behavior based on the assumed identity of the host from previously exchanged identify frames, if the previously used training algorithm was sufficient for interface transmitter training for the particular host. The drive will go directly to the correct training algorithm without the need to do a PHY reset using a training algorithm that is tailored to the host and thus reduce interface transmitter training time. | 2021-10-14 |
20210318980 | PEER-TO-PEER LINK SHARING FOR UPSTREAM COMMUNICATIONS FROM XPUS TO A HOST PROCESSOR - A processor unit comprising a first controller to couple to a host processing unit over a first link; a second controller to couple to a second processor unit over a second link, wherein the second processor unit is to couple to the host central processing unit via a third link; and circuitry to determine whether to send a cache coherent request to the host central processing unit over the first link or over the second link via the second processing unit. | 2021-10-14 |
20210318981 | Selection of Communication Protocol for Management Bus - An apparatus may include a controller for a system management bus. The controller may be to: detect a trigger event associated with the system management bus; in response to a detection of the trigger event, transmit a broadcast address on the system management bus, where the broadcast address is not used in a first communication protocol; and in response to a determination that the transmitted broadcast address was acknowledged, use a second communication protocol for transmissions on the system management bus. Other embodiments are described and claimed. | 2021-10-14 |
20210318982 | Data transfer system, circuit, and method - Disclosed is a data transfer system capable of accelerating data transmission between two chips. The data transfer system includes: a master system-on-a-chip (SoC) including a master transmission circular buffer and a master reception circular buffer; and a slave SoC including a slave reception circular buffer and a slave transmission circular buffer. The slave/master reception circular buffer is a duplicate of the master/slave transmission circular buffer; accordingly, the write pointers of the two corresponding buffers are substantially synchronous and the read pointers of the two corresponding buffers are substantially synchronous as well. In light of the above, the read and write operations of the master/slave transmission circular buffer can be treated as the read and write operations of the slave/master reception circular buffer; therefore some conventional data reproducing procedure(s) for the data transmission can be omitted and the data transmission is accelerated. | 2021-10-14 |
20210318983 | VECTOR REDUCTION PROCESSOR - A vector reduction circuit configured to reduce an input vector of elements comprises a plurality of cells, wherein each of the plurality of cells other than a designated first cell that receives a designated first element of the input vector is configured to receive a particular element of the input vector, receive, from another of the one or more cells, a temporary reduction element, perform a reduction operation using the particular element and the temporary reduction element, and provide, as a new temporary reduction element, a result of performing the reduction operation using the particular element and the temporary reduction element. The vector reduction circuit also comprises an output circuit configured to provide, for output as a reduction of the input vector, a new temporary reduction element corresponding to a result of performing the reduction operation using a last element of the input vector. | 2021-10-14 |
20210318984 | PROCESSOR, SYSTEM ON CHIP INCLUDING HETEROGENEOUS CORE, AND OPERATING METHODS THEREOF - Provided is an operation method of a processor including a plurality of heterogeneous cores, the operation method including selecting an execution core of the plurality of heterogeneous cores for executing an application, loading, from a memory, first data corresponding to core information of the execution core during runtime of the execution core, wherein the first data is included in compile data, the compile data including a first function compiled for each heterogeneous core of the plurality of heterogeneous cores, the first function being a function from among a plurality of functions of the application that is at least one of frequently called or having a long execution time, and processing, by the execution core, execution codes for executing the application, based on the first data. | 2021-10-14 |
20210318985 | LEADER ELECTION WITH LIFETIME TERM - A processing device receives request from a process of a plurality of processes of a clusterized service, to attempt to create, in a file system accessible by the process, a file associated with a leader state of the plurality of processes. Responsive to successfully creating the file, the processing device to enable the process to enter the leader state. The processing device is further to enable the process to stay in the leader state for a lifetime of the process. | 2021-10-14 |
20210318986 | USING PREFIX-DELETE OPERATIONS FOR DATA CONTAINERS - A key-value pair comprising a key and a value associated with the key is stored in a current segment of a data container. The key comprises a segment identifier identifying the current segment. The data container comprises a plurality of segments residing on a non-volatile memory device. Responsive to determining that a size of the current segment exceeds a threshold, a new segment is added to the container. The plurality of key-value pairs having respective current segment identifiers referencing one or more least recently created segments of the data container is deleted. | 2021-10-14 |
20210318987 | METADATA TABLE RESIZING MECHANISM FOR INCREASING SYSTEM PERFORMANCE - Provided is a key value store for storing data to a storage device, the key value store being configured to insert a key and key information, which includes a device key, a value size, a sequence number, and another attribute of the key, into an unsorted queue after storing a key value block in the storage device, insert the key and the key information into, or update the key and the key information in, a sorted metadata table, insert the key information corresponding to the key, and including a key information table ID and an offset of the key information, into a key information table, write the key information table to a storage device, and write the sorted metadata table as an eviction candidate to the storage device. | 2021-10-14 |
20210318988 | SHARED STORAGE FILE SYSTEM MECHANISM - A high-performance computing (HPC) system is described. The system includes at least one administrative leader node including a distributed file system server to host a plurality of filesystem images to facilitate a shared filed system, one or more storage devices configured as shared storage having a writable area to host filesystem images for the shared filed system and a plurality of compute nodes, wherein each compute node to mount a compute-node specific directory received from the server in the writable area in the shared storage and mount a filesystem within a filesystem image as a read-write area at the shared storage. | 2021-10-14 |
20210318989 | File-Based Sharing Using Content Distributions Network - Embodiments relate to file-based sharing of content through a content distribution network. A request is received from a source to disseminate content to a target consumer. The request does not include target consumer URL information. Based upon the request, content metadata stored in a database with content data, is referenced to generate a file including metadata comprising a portion of the content metadata. The file does not include the content data. The file is exported to the source. The source delivers the file to the target consumer through a communication channel (e.g., shared folder, email) located outside of the distribution network. The file is imported from the target consumer. The metadata of the file is processed to examine its integrity. The metadata may comprise a key for reference during this process. Upon confirming integrity of the file, the content data and the content metadata are distributed to the target consumer. | 2021-10-14 |
20210318990 | UNIFIED FILE STORAGE SYSTEM - A computing system may store a first file in a system repository that is to be synchronized with at least a first repository associated with a first client device and a second repository associated with a second client device. The computing system may determine that the first repository is to receive a downloaded copy of at least a portion of the first file, and may cause a copy of the at least a portion of the first file to be downloaded from the system repository to the first repository. Based at least in part on the computing system determining that the first repository is to receive the downloaded copy, an identifier of the at least a portion of first file may be stored in the second repository without storing a copy of the at least a portion of the first file in the second repository. | 2021-10-14 |
20210318991 | MULTI-CLOUD BI-DIRECTIONAL STORAGE REPLICATION SYSTEM AND TECHNIQUES - Disclosed are systems, apparatuses and techniques for replicating data between different cloud computing platforms. Examples include storage replicator components operable in different cloud computing platforms. The first storage replicator component may identify the second cloud computing platform as a location to copy a data file in response to an event related to the data file stored in a first cloud computing platform. The first storage replicator component may request a copy of the data file via an application programming interface of the first cloud computing platform. The attributes of the copy of the data file which involve modification to conform to data management conventions of the second cloud computing platform may be determined and modified to comply with conventions of the second cloud computing platform. The modified copy of the data file may be forwarded to the second cloud computing platform for storage. | 2021-10-14 |
20210318992 | SUPPORTING STORAGE USING A MULTI-WRITER LOG-STRUCTURED FILE SYSTEM - Solutions for supporting storage using a multi-writer log-structured file system (LFS) are disclosed that include receiving incoming data from an object of a plurality of objects that are configured to simultaneously write to the LFS from different nodes; based at least on receiving the incoming data, determining whether sufficient free segments are available in a local segment usage table (SUT) for writing the incoming data; based at least on determining that insufficient free segments are available , requesting allocation of new free segments; writing the incoming data to a log; acknowledging the writing to the object; determining whether the log has accumulated a full segment of data; based at least on determining that the log has accumulated a full segment of data, writing the full segment of data to a first segment of the free segments; and updating the local SUT to mark the first segment as no longer free. | 2021-10-14 |
20210318993 | DEDUPLICATION OF ENCRYPTED DATA USING MULTIPLE KEYS - Deduplication of encrypted data using multiple keys includes responding to a request to store a predetermined set of data in an electronic data store by receiving a hash corresponding to the predetermined set of data, receiving encrypted data generated by encrypting the predetermined set of data using an encryption key, and receiving a key index corresponding to the encryption key. The hash may be determined to match a previously stored hash, the previously stored hash indicating that a previously encrypted version of the predetermined set of data is stored at a physical location in the electronic data store. Based on determining that the hash matches a previously stored hash, the hash, encrypted data, and key index are discarded. | 2021-10-14 |
20210318994 | EXTENSIBLE STREAMS FOR OPERATIONS ON EXTERNAL SYSTEMS - The subject technology determines, using a stream object provided by a network-based database system separate from an external system, a set of offsets of each shard of a set of shards, the set of offsets being determined by executing a user defined function (UDF) included in the stream object, the stream object and the UDF being implemented in a particular programming language different than a database query language. The subject technology identifies an operation to perform on the set of shards. The subject technology, based on the set of shards and the set of offsets, performs, using the UDF included in the stream object, the operation on an external data source hosted by the external system. The subject technology increments a property indicating a different version of the stream object after performing the operation on the external data source, the property being included in the stream object. | 2021-10-14 |
20210318995 | CANDIDATE ELEMENT SELECTION USING SIGNIFICANCE METRIC VALUES - Techniques and solutions are described for determining a set of elements of a second set that may correspond to a given element of a first set of elements. The elements can be, in specific examples, components of a database system, such as tables (or entities), attributes, or records. Significance metric values are calculated for elements in the first and second sets. The significance metric values can be a number of records in an entity or a number of read or write access operations for an entity or for a record of an entity. A significance metric value for the given element can be used at least in part to select elements of the second set as potential match candidates, based at least in part on significance metric values for elements of the second set. Selecting elements can include selecting elements based on a window of elements of the second set or a range of significance metric values. | 2021-10-14 |
20210318996 | METHODS, APPARATUSES, AND DEVICES FOR TRANSFERRING DATA ASSETS BASED ON BLOCKCHAIN - Embodiments of the present specification disclose methods, apparatuses, and devices for transferring data assets based on a blockchain. One method includes: obtaining usage demand information of a data requestor for using original data, wherein the usage demand information indicates a demand of the data requestor for performing computations based on the original data; sending a usage authorization request for the original data to a data owner of the original data based on a decentralized identifier (DID) corresponding to the original data; receiving confirmation information of the usage authorization request from the data owner; processing the original data based on the usage demand information to obtain a processing result; transmitting the processing result to the data requestor; and generating a verifiable claim (VC) for recording usage information of the original data. | 2021-10-14 |
20210318997 | Archiving Objects in a Database Environment - A method is provided for processing a query. In some embodiments, the method includes creating a historical schema defining an ordered set of fields based on a current schema of an object and a field modification of the current schema. The method includes inserting, based on the field modification, a new field at an end of the historical schema and archiving records into a second storage device. The method includes receiving a query, which includes a command specifying a subset of fields and which indicates a non-current field. The method includes searching in the second storage device for archive records having a second schema including the subset of fields and the non-current field. The first and second schemas follow the field order in accordance with the historical schema. The method further includes accessing the subset of fields and the non-current field in accordance with the command. | 2021-10-14 |
20210318998 | DYNAMIC SCHEMA BASED MULTITENANCY - Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: running an application on one or more computing node, the application providing user access to a database; receiving by the application registration data from a user for registering the user into a service; in response to the receiving the registration data from the user, generating a user schema that defines access rights of the user to the database, wherein the generated user schema includes a set of shared data structure objects instantiated in a storage system associated to the application, and a set of private data structure objects. | 2021-10-14 |
20210318999 | BIOSENSORS FOR BIOLOGICAL OR CHEMICAL ANALYSIS AND SYSTEMS AND METHODS FOR SAME - A biosensor is provided including a detection device and a flow cell mounted to the detection device. The detection device has a detector surface with a plurality of reaction sites. The detection device also includes a filter layer that is configured to at least one of (a) filter unwanted excitation light signals; (b) direct emission signals from a designated reaction site toward one or more associated light detectors that are configured to detect the emission signals from the designated reaction site; or (c) block or prevent detection of crosstalk emission signals from adjacent reaction sites. | 2021-10-14 |
20210319000 | DATA DEDUPLICATION AND DATA MERGING | 2021-10-14 |
20210319001 | DATA SPACE SCALABILITY FOR ALGORITHM TRAVERSAL - A system for data space limitation includes and interface and a processor. The interface is configured to receive a query for a structured data set. The processor is configured to determine an ordered list for calculations to respond to the query; perform the calculations according to the ordered list until an allowed time required for interactivity is reached; and in response to the allowed time being reached, provide results of the calculations. | 2021-10-14 |
20210319002 | METHOD AND SYSTEM FOR INDEXING OF TIME-SERIES DATA - A method of maintaining an index of time-series data records held in a data store comprises identifying one or more time-series data records not currently indexed in a binary tree structure and corresponding with a time range, and creating a new leaf node. Start-time and end-time fields of the new leaf node are populated with values encompassing the time range corresponding with identified time-series data records. The binary tree structure is updated such that the new leaf node is added as a first or second child node of a parent node representing a time range encompassing the values of the start-time and end-time fields of the new leaf node. Existence of the new leaf node in the binary tree structure is thereby indicative of existence of the one or more identified time-series data records in the data store. | 2021-10-14 |
20210319003 | SYSTEM AND METHOD FOR GENEALOGICAL ENTITY RESOLUTION - Systems, methods, and other techniques for genealogical entity resolution. In some embodiments, first tree data and second tree data are obtained, the first tree data corresponding to a first tree person and the second tree data corresponding to a second tree person. A set of features is extracted from the first tree data and the second tree data. An individual-level similarity score for each possible pairing of tree persons is generated based on the set of features. A set of most-similar tree persons is identified based on the individual-level similarity score for each possible pairing. A plurality of individual-level similarity scores for the set of most-similar tree persons are provided as input to a family-level ML model to determine that the first tree person and the second tree person correspond to a same individual. | 2021-10-14 |
20210319004 | TECHNIQUES FOR CREATING AND UTILIZING MULTIDIMENSIONAL EMBEDDING SPACES - Various embodiments are generally directed to techniques for creating and utilizing multidimensional embedding spaces for data objects, such as to condition the data for input to a neural network, for instance. Some embodiments are particularly directed to converting semi-structured data, such as a set of data objects, into object vector sets mapped to a multidimensional embedding space. In many embodiments, an embedding space for a set of data objects may be customized with a set of dimensions that correspond to various characteristics of the set of data objects. These and other embodiments are described and claimed. | 2021-10-14 |
20210319005 | Database Creation and Collison Reduction - A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables. | 2021-10-14 |
20210319006 | Method And System To Estimate The Cardinality Of Sets And Set Operation Results From Single And Multiple HyperLogLog Sketches - A system and method for the estimation of the cardinality of large sets of transaction trace data is disclosed. The estimation is based on HyperLogLog data sketches that are capable to store cardinality relevant data of large sets with low and fixed memory requirements. The disclosure contains improvements to the known analysis methods for HyperLogLog data sketches that provide improved relative error behavior by eliminating a cardinality range dependent bias of the relative error. A new analysis method for HyperLogLog data structures is shown that uses maximum likelihood analysis methods on a Poisson based approximated probability model. In addition, a variant of the new analysis model is disclosed that uses multiple HyperLogLog data structured to directly provide estimation results for set operations like intersections or relative complement directly from the HyperLogLog input data. | 2021-10-14 |
20210319007 | INTELLIGENT RECORD GENERATION - Examples of a record generation system are provided. The system may receive a record generation requirement from a user. The system may obtain record data, a plurality of user documents, and identify a record corpus from the record data. The system may sort the record data into a plurality of data domains. The system may determine at least one record mapping context including a record value from the plurality of user documents. The system may determine a selection rule from the plurality of data domains for each of the record mapping context. The system may create a record index corresponding to the plurality of user documents. The system may create a record generation model corresponding to the record generation requirement based on the record index. The system may generate a record generation result corresponding to the record generation requirement comprising the relevant record generation model. | 2021-10-14 |
20210319008 | TIME-BASED DATA RETRIEVAL PREDICTION - Techniques are disclosed relating to determining a predicted time interval for querying a database beginning at a starting point in time to retrieve a specified number of records. A computer system receives a request for records from a database that stores timestamped records, where the request is for a specified number of records beginning at a starting point in time. The computer system then determines a predicted time interval for querying the database beginning at the starting point in time to retrieve the specified number of records, where the predicted time interval may be determined by a machine learning module that is trained using historical database transaction data. Such techniques may advantageously improve the efficiency of individual queries in fetching a desired amount of data from a database for applications. | 2021-10-14 |
20210319009 | Generating Three-Dimensional Spikes Using Low-Power Computing Hardware - Aspects described herein include a method of generating three-dimensional (3D) spikes. The method comprises receiving a signal comprising time-series data and generating a first two-dimensional (2D) grid. Generating the first 2D grid comprises mapping segments of the time-series data to respective positions of the first 2D grid, and generating, for each position, a spike train corresponding to the respective mapped segment. The method further comprises generating a second 2D grid including performing, for each position, a mathematical operation on the spike train of the corresponding position of the first 2D grid. The method further comprises generating a third 2D grid including performing spatial filtering on the positions of the second 2D grid. The method further comprises generating a 3D grid based on a combination of the first 2D grid, the second 2D grid, and the third 2D grid. The 3D grid comprises one or more 3D spikes. | 2021-10-14 |
20210319010 | RAPID LEDGER CONSENSUS SYSTEM AND METHOD FOR DISTRIBUTED WIRELESS NETWORKS - A computing device functions as a member of a distributed database system implemented using a wireless network. A member version of a chain graph is stored at the computing device. The chain graph includes events created by the computing device and events received through the wireless network from other computing devices that are members of the distributed database system. The computing device determines if it is a member of a voting committee that comprises only a subset of the computing devices that are members of the distributed database system. When the computing device is a member of a voting committee, it participates in a distributed consensus algorithm with other members of the voting committee using the wireless network to define an order of the events in the chain graph and stores that order as a new event in the member version of the chain graph. | 2021-10-14 |
20210319011 | METADATA TABLE RESIZING MECHANISM FOR INCREASING SYSTEM PERFORMANCE - Provided is a method of database management, the method including identifying an attribute of a metadata table causing increased input/output overhead associated with accessing the metadata table, and dividing the metadata table into one or more submetadata tables to reduce or eliminate the attribute, or to isolate the attribute to one of the submetadata tables. | 2021-10-14 |
20210319012 | ASSET MANAGEMENT METHOD AND APPARATUS, AND ELECTRONIC DEVICE - This specification describes techniques for managing assets in a blockchain. One example method includes receiving, from a target user recorded in a distributed database of the blockchain network, a user input including a request to generate an asset object in the blockchain network, the blockchain network including an account object and a contract object, determining, based on the user input, an asset type of the asset object, initiating, in the blockchain network, the contract object corresponding to generate the asset object based on the asset type, the asset object including a digital asset corresponding to a physical asset associated with the target user, assigning the asset object to a target object of the target user, and adding address information of the asset object to the target object. | 2021-10-14 |
20210319013 | COMPUTER METHODS AND COMPUTER SYSTEMS FOR AUTOMATIC DATA ANALYSIS, RECONCILLIATION AND REPAIR - In some embodiments, the instant invention includes a computer-implemented method that includes: specifically programming at least one computer system to perform: automatically obtaining input financial data; automatically determining units of work that the input financial data can be organized into; automatically importing the input financial data into a database based on the units of work; automatically validating the imported input financial data, by: identifying deficient units of work based on predefined rules, where each deficient unit of work has a current data error; analyzing, based on research information, the current data error to determine a current corrective action to remedy the current data error; and verifying that the current corrective action does not result in: an additional deficient unit of work, an additional data error, and a change in at least one predefined data report; and automatically executing the current corrective action to remedy the current data error. | 2021-10-14 |
20210319014 | FAST PROCESSING METHOD OF MASSIVE TIME-SERIES DATA BASED ON AGGREGATED EDGE AND TIME-SERIES AGGREGATED EDGE - A fast processing method of massive time-series data based on aggregated edges and time-series aggregated edges implements fast and real-time processing based on an association of a graph data structure under a massive data pattern. In terms of incremental flow calculation based on time windows, the present disclosure proposes an innovative data structure of “aggregated edge” and “time-series aggregated edge”, which is suitable for data modeling of real-time dynamic graph. The present disclosure introduces a time-series graph query language, which adds descriptive semantics of time series information, and not only supports basic queries based on vertices, edges, and attributes, but also can implement users' graph queries for index calculation results in a time window. The graph query includes graph matching and graph filtering. The present disclosure is especially suitable for fields such as marketing and real-time risk control based on massive data mining and has good timeliness control and high scalability. | 2021-10-14 |
20210319015 | PATHNAMES WITH EMBEDDED QUERIES - In one embodiment, a method includes receiving, at a network management system (NMS) from a client, a message having an object reference embedding a query, the query requesting an operation to be performed on data stored in a data tree maintained by the NMS. The method provides for generating, by the NMS, a result of the query by performing the operation on the data. In this embodiment, the method further provides for sending, by the NMS to the client, the result of the query. In some embodiments, the object reference may include a pathname. | 2021-10-14 |
20210319016 | PREDEFINED SEMANTIC QUERIES - An information retrieval system and method are presented. A template is retrieved from a template repository. The template repository stores a plurality of templates. Each of the plurality of templates includes a concept and a relationship from a knowledge model. The knowledge model defines a plurality of entities and interrelationships between one or more of the plurality of entities. The plurality of entities include concepts and instances. The template is transmitted to a client computer, and a statement is received from the client computer. The statement includes an instantiation of the template. A knowledge base is queried using the statement to generate a result listing identifying an item in the knowledge base. The knowledge base identifies a plurality of items. Each of the plurality of items is associated with at least one annotation identifying at one of the entities in the knowledge model. | 2021-10-14 |
20210319017 | MOBILE SEARCH - Techniques for providing consumer device interfaces are discussed herein. Some embodiments may include a system, including processing circuitry configured to: connect with a consumer device via a network; provide a search interface to the consumer device; receive one or more search parameters from the consumer device via the network; determine card scores for candidate cards based on the one or more search parameters, wherein each card includes an electronic marketing message indicating one or more items; determine a card score ranking based on the card scores; determine whether the consumer device is a mobile device; and in response to determining that the consumer device is a mobile device: determine mobile card layout; generate a mobile interface based on the mobile card layout; and provide one or more of the candidate cards to the mobile interface based on the card score ranking and the mobile card layout. | 2021-10-14 |
20210319018 | Database Creation using Table Type Information - A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables. | 2021-10-14 |
20210319019 | INFORMATION PROCESSING APPARATUS AND NON-TRANSITORY COMPUTER READABLE MEDIUM - An information processing apparatus includes a processor configured to display a screen for specifying one or more search conditions of a search. The screen presents one or more search histories. Each search history of the one or more search histories presents one or more previous search conditions used for a previous search, together with an attribute of a file on which a user performed an operation following the previous search. | 2021-10-14 |
20210319020 | NEURAL NETWORK-BASED DOCUMENT SEARCHING SYSTEM - Systems for performing methods for searching documents are disclosed. The system may receive a first document comprising textual content, summarize the textual content using a first neural network, and translate the summarized textual content into translated content (e.g., content translated into Lojban) using a second neural network. The system may also conduct a fuzzy search of a database using the translated content for similar translated content from a plurality of documents and output results of the fuzzy search. | 2021-10-14 |
20210319021 | DATA PREFETCHING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND COMPUTER-READABLE STORAGE MEDIUM - The present disclosure provides a data prefetching method, a data prefetching apparatus, an electronic device and a computer-readable storage medium. The data prefetching method includes: acquiring a query prefix inputted by a user; analyzing the query prefix in accordance with a pre-trained linguistic model to acquire a perplexity of the query prefix; judging whether the perplexity is smaller than a predetermined threshold; and transmitting a prefetching request in accordance with the query prefix when the perplexity is smaller than the predetermined threshold. | 2021-10-14 |
20210319022 | PARALLEL PRUNING AND BATCH SORTING FOR SIMILARITY SEARCH ACCELERATORS - Systems, apparatuses and methods include technology that determines, with a first processing engine of a plurality of processing engines, a first partial similarity measurement based on a first portion of a query vector and a first portion of a first candidate vector. The technology determines, with a second processing engine of the plurality of processing engines, a total similarity measurement based on the query vector and a second candidate vector. The technology determines, with the first processing engine, whether to compare a second portion of the query vector to a second portion of the first candidate vector based on the first partial similarity measurement and the total similarity measurement. | 2021-10-14 |
20210319023 | TRANSFORMING QUERIES USING BITVECTOR AWARE OPTIMIZATION - the present disclosure relates to systems, methods, and computer-readable media for optimizing and implementing operator trees based on a received query. For example, systems disclosed herein may generate an operator tree based on a received query. The systems described herein may systematically analyze the impact of bitvector filters in optimizing a join order of the operator tree to generate an optimized operator tree. The systems described herein may further implement the bit-vector aware operator tree by providing the optimized operator tree to an execution engine for further processing. | 2021-10-14 |
20210319024 | METHODS AND SYSTEMS FOR JOINING INDEXES FOR QUERY OPTIMIZATION IN A MULTI-TENANT DATABASE - Methods and systems for query optimization for a multi-tenant database system are provided. Some embodiments comprise receiving at a network interface of a server in a multi-tenant database system an original query transmitted to the multi-tenant database system by a user associated with a tenant, wherein the original query is associated with data accessible by the tenant, and wherein the multi-tenant database system includes at least a first index and a second index. Metadata associated with the data is retrieved, wherein at least a portion of the data is stored in a common table within the multi-tenant database system. A tenant-selective query syntax is determined by analyzing at least one of metadata generated from information about the tenant or metadata generated from the data accessible by the tenant. An improved query is then generated using the query syntax, wherein the improved query is based at least in part upon the original query and a result of a join between a first number of rows associated with the first index and a second number of rows associated with the second index. | 2021-10-14 |
20210319025 | PRUNING INDEX MAINTENANCE - A source table organized into a set of micro-partitions is accessed by a network-based data warehouse. A pruning index is generated based on the source table. The pruning index comprises a set of filters that indicate locations of distinct values in each column of the source table. A query directed at the source table is received at the network-based data warehouse. The query is processed using the pruning index. The processing of the query comprises pruning the set of micro-partitions of the source table to scan for data matching the query, the pruning of the plurality of micro-partitions comprising identifying, using the pruning index, a sub-set of micro-partitions to scan for the data matching the query. | 2021-10-14 |
20210319026 | DEFINING ATTRIBUTE FEATURE VECTORS FOR MATCHING DATA ENTITIES - Matching records in an entity resolution system by defining entity attribute feature vectors, determining an entity attribute matching score according to a distance between two entity attribute feature vectors, assigning a statistical weight to an entity attribute matching score, adjusting the entity attribute matching score according to the statistical weight and an entity attribute frequency of occurrence, and determining an aggregate entity attribute matching score. | 2021-10-14 |
20210319027 | CONTEXT DRIVEN DATA PROFILING - The present disclosure relates to methods and systems for processing data via a data profiling process. Data profiling can include modifying attributes included in source data and identifying aspects of the source data. The data profiling process can include processing an attribute according to a set of validation rules to validate information included in the attribute. The process can also include processing the attribute according to a set of standardization rules to modify the attribute into a standardized format. The process can also include processing the attribute according to a set of rules engines. The modified attributes can be outputted for further processing. The data profiling process can also include deriving a value score and usage rank of an attribute, which can be used in deriving insights into the source data. | 2021-10-14 |
20210319028 | Database Creation using Domain-Specific Information - A system, method, and computer-readable medium for proving feedback on database instructions, identifying, for example, existing patterns and providing suggested replacement instructions. This may have the effect of improving the efficiency of instructions used to create and/or manipulate databases. According to some aspects, these and other benefits may be achieved by parsing received instructions into an organizational structure, traversing the organizational structure for known patterns, and suggesting replacement patterns. In implementation, this may be effected by receiving one or more sets of known patterns and corresponding replacement patterns, parsing received instructions, comparing the known patterns with the parsed instructions, and providing suggested replacement patterns based on one or more known patterns matching the parsed instructions. A benefit of may include reducing Cartesian products during the merging of tables. | 2021-10-14 |
20210319029 | PHRASE TRANSLATION FOR A LOW-LATENCY DATABASE ANALYSIS SYSTEM - Operating a low-latency database analysis system with phrase translation may include obtaining a locale-specific phrase localization rule and a canonical phrase localization rule for a phrase, generating a locale-specific index and a locale-specific finite state machine for the locale using the localization definition data and a canonical finite state machine, generating a resolved-request by obtaining a locale-specific token representing locale-specific input data by traversing the locale-specific index, obtaining a canonical token associated with locale-specific token, obtaining a locale-specific phrase by traversing the locale-specific finite state machine, obtaining a canonical phrase corresponding to the locale-specific phrase, the canonical phrase including the canonical token, generate a data-query based on the canonical phrase, obtaining results data responsive to the data expressing the usage intent by executing a query corresponding to the data-query by an in-memory database of the low-latency database analysis system, and outputting the results data for presentation to a user. | 2021-10-14 |
20210319030 | Method, System, and Computer Program Product for Identifying and Resolving Constraint Violations in a Database Replication System - A method, system, and computer program product for identifying and resolving constraint violations in a database replication system determine a predetermined type of constraint violation and, in response thereto, write a record that failed to replicate into an error table on a target database and create a trigger on the error table to automatically and immediately handle the error record, based on why the record failed to replicate. | 2021-10-14 |
20210319031 | Managing Real Time Data Stream Processing - A method for managing data processing includes receiving, from a user of a data query system, a data query for data stored in a data store in communication with the data query system. The method also includes receiving a staleness parameter indicating an upper time boundary for the data query. The upper time boundary limits a query response to data within the data store that is older than the upper time boundary. The method further includes determining whether the data stored within the data store satisfies the staleness parameter. When a portion of the data within the data store fails to satisfy the staleness parameter, the method includes generating the query response that excludes the portion of the data that fails to satisfy the staleness parameter. | 2021-10-14 |
20210319032 | SYSTEMS AND METHODS FOR CONTEXTUAL RETRIEVAL AND CONTEXTUAL DISPLAY OF RECORDS - Provided are systems and methods for the contextual retrieval and contextual display of records. A search query and/or search results may be contextually enhanced based on (i) natural language processing (NLP) models, (ii) user behavior, and/or (iii) relationships between various entities involved in a search, such as between users, records, and/or fields of expertise. Contextually enhanced search results may be delivered and displayed to a user on a user interface in a contextually relevant order. | 2021-10-14 |
20210319033 | LEARNING TO RANK WITH ALPHA DIVERGENCE AND ENTROPY REGULARIZATION - In an example embodiment, α-divergence is used to replace cross-entropy or KL-divergence as the loss function for learning-to-rank tasks in an online network. Additionally, in an example embodiment, entropy regularization is used to encourage score diversity for documents of the same relevance level. The result of both these approaches it to reduce or eliminate technical problems encountered using prior art techniques. | 2021-10-14 |
20210319034 | PREDICTIVE DISPLAY OF FOLDER STRUCTURE - A computing system generates a default view of content items associated with a user account. The default view is representative of an underlying hierarchical structure of the content items associated with the user account. The computing system receives a request to transition from the default view to a modified view of the content items. The computing system ranks the content items based on a predicted likelihood of the user interacting with the particular content item. The computing system identifies the subset of content items for the modified view based on the ranking. The computing system generates the modified view based on the identified subset of the content items. The modified view maintains the underlying hierarchical structure of the content items associated with the user account. The computing system provides the modified view to the user associated with the user account for display. | 2021-10-14 |
20210319035 | MACHINE LEARNING SYSTEM AND METHOD TO MAP KEYWORDS AND RECORDS INTO AN EMBEDDING SPACE - In some embodiments, a method includes determining a position for a search query and a position for each audience record from multiple audience records in an embedding space. The method further includes receiving multiple device records, each associated with an audience record. The method further includes determining multiple keywords, each associated with an audience record and determining a position for each keyword in the embedding space. The method further includes calculating a first distance between the position of the search query in the embedding space and the position of each audience record in the embedding space. The method further includes calculating a second distance between the position of the search query in the embedding space and the position of each keyword in the embedding space. The method further includes ranking each audience record based on the first distance and the second distance. | 2021-10-14 |
20210319036 | Method and System For Retrieving and Displaying Data From an Entity Network Database - A computer-implemented method of retrieving and displaying data from an entity network database ( | 2021-10-14 |
20210319037 | RANKING SEARCH RESULTS USING HIERARCHICALLY ORGANIZED COEFFICIENTS FOR DETERMINING RELEVANCE - An online system receives a search query from a user. In response to the request, the online system obtains search results matching the search query and identifies a set of attributes describing a context of the search query. The online system generates a data structure that includes a plurality of search coefficients. The search coefficients are selected based on the identified set of attributes. Some of the search coefficients have conflicting values. The online system traverses the data structure to identify the search coefficients having conflicting values. For each search coefficient having conflicting values, the online system resolves conflicts and determines a value of the search coefficient. The online system ranks search results based on the resolved values of the search coefficients. | 2021-10-14 |
20210319038 | SOFTWARE AGNOSTIC WEB LOCATED APPLICATION INTERFACE TO A LOCALLY LOCATED DATABASE INTEGRATION BROKER FUNCTIONALITY - Methods, devices, and systems for providing a software agnostic integration broker system are disclosed. One system includes a user access computing device, wherein the user access computing device has access to: a database stored in memory on a device within a local network of devices connected to the user access computing device, the database having data stored therein, and an integration broker tool stored in memory on one of the devices of the local network, wherein the integration broker tool processes instructions received from a data administrative application on a computing device outside of the local network, retrieves data from the database based on the instructions received from the data administrative application, sends the retrieved data to a remote location that is outside the local network, and displays the information on a web based portal provided by the data administrative application to the user on the user access computing device. | 2021-10-14 |
20210319039 | EXTRACTION OF A NESTED HIERARCHICAL STRUCTURE FROM TEXT DATA IN AN UNSTRUCTURED VERSION OF A DOCUMENT - An apparatus comprises a processing device configured to analyze an unstructured version of a document to read text data contained therein having a nested hierarchical structure comprising two or more levels and to obtain at least one sample item for a given one of the levels in the nested hierarchical structure. The processing device is also configured to determine a list type associated with the at least one sample item, to identify items having the determined list type in the text data as belonging to the given, and to extract portions of the text data corresponding to respective ones of the items having the determined list type. The processing device is further configured to generate a structured version of the document that associates the extracted portions of the text data with the corresponding ones of the items having the determined list type. | 2021-10-14 |
20210319040 | EXTENDED CORRELATION METHODS IN A CONTENT TRANSFORMATION ENGINE - A method for communicating data includes interfacing different data sources to stand-alone software agents customized for the different data sources. The method also providing selected source data to the stand-alone software agents to generate first-stage data feeds in a neutral format in accordance with the customization. The selected source data is dynamically selected from within the data sources, and transformed into the first-stage data feeds in the neutral format. The stand-alone software agents send the first-stage data feeds to an aggregation agent. The aggregation agent generates for a user and based on specified criteria, a second-stage output as a composite of selected source data from the first-stage data feeds. | 2021-10-14 |
20210319041 | METHOD FOR DISPLAYING PERSONAL DATABASE CONTENTS ON COMPUTER SCREEN - The invention relates to computing technologies, in particular to a method for displaying personal database contents on a computer screen. The technical effect lies in ensuring personal interactivity of the graphical display of the personal database contents on the computer screen. According to the method, the personal database contains a plurality of data files, each data file is assigned at least one associative identifier that the user associates with said data file, the method comprises obtaining a primary graph comprising a graphical representation of the assigned associative identifiers in the form of a network, each network node comprises an icon of a unique associative identifier from among the assigned associative identifiers, wherein the network nodes are connected in pairs so that between each pair of icons depicting the associative identifiers assigned to the same data file, a link is formed. The method differs from the known prior art solutions in calculating for each associative identifier of a weighting factor (m), the weighting factor (m) determining the size of the associative identifier icon, calculating for each link of a weighting factor (n), the weighting factor (n) determining a display parameter of said link, and obtaining a modified graph in response to each change in at least one of said weighting factors (m, n). | 2021-10-14 |
20210319042 | CONTENT SOURCE INTEGRATION - In one embodiment, a web content management system is coupled to remote resources via a framework that has one or more corresponding adapters which enable editing of content by invoking editors which are native to the respective remote resources. The system retrieves a content item from a remote resource and stores a copy of the content item in a local repository, while the original content item remains in the repository of the remote resource. A content item can be selected in in a local authoring tool, causing the system to examine the content item's metadata to identify the source repository and invoke the native editor of the corresponding remote resource, enabling editing of the content item using the native editor. The copy of the content item in the local repository can then be synchronized to the edited version of the content item in the remote resource. | 2021-10-14 |
20210319043 | MULTI-SOURCE DATA MANAGEMENT MECHANISM AND PLATFORM - Platforms and mechanisms for multi-source data management are provided. In accordance with one aspect, a knowledge mining engine comprising an on-line knowledge mining component supporting multi-dimensional queries for on-line knowledge mining of multi-source data and an off-line knowledge mining component for running knowledge mining procedures for off-line knowledge mining of the multi-source data. The multi-source data management platform/mechanism may also include an adaptive data collector to collect data actively and passively, a data analysis cascade to cleanse and analyse the multi-source data concurrently and separately, a data integration cascade to consolidate and integrate the multi-source data according to multiple data integration dimensions, a centralized data repository implementing RESTful APIs for data CRUD operations and storing multi-source data generated in the platform, and a data sharing portal to share data and mined knowledge to users and up-layer applications. | 2021-10-14 |
20210319044 | Shuffle-less Reclustering of Clustered Tables - A method for shuffle-less reclustering of clustered tables includes receiving a first and second group of clustered data blocks sorted by a clustering key value. A range of clustering key values of one or more the data blocks in the second group overlaps with the range of clustering key values of a data block in the first group. The method also includes generating split points for partitioning the first and second groups of clustered data blocks into a third group. The method also includes partitioning using the split points, the first and second groups into the third group. Each data block in the third group includes a range of clustering key values that do not overlap with any other data block in the third group. Each split point defines an upper limit or lower limit for the range of clustering key values a data block in the third group. | 2021-10-14 |
20210319045 | EFFICIENT FACTOR ANALYSIS ON LARGE DATASETS USING CATEGORICAL VARIABLES - Methods and apparatus are disclosed for efficient factor analysis of a large population of data records, using factors that are categorical variables. Computation is balanced between extracting key factors by training a machine learning classifier on a reduced sample of data records, for computational efficiency, and scoring the categorical values of the key factors on the entire population, for accuracy of results. A joint factor is constructed by combining all proposed root factors, and the sample is generated by stratified sampling on the joint factor. The key factors are selected from candidate factors which can be combinations of the root factors. Original variables of a dataset, whether categorical or not, can be binned to obtain new categorical factors. Variations and user interfaces are also disclosed. | 2021-10-14 |
20210319046 | METHOD AND SYSTEM FOR HIERARCHICAL TIME-SERIES CLUSTERING WITH AUTO ENCODED COMPACT SEQUENCE (AECS) - Conventional hierarchical time-series clustering is highly time consuming process as time-series are characteristically lengthy. Moreover, finding right similarity measure providing best possible hierarchical cluster is critical to derive accurate inferences from the hierarchical clusters. Method and system for Auto Encoded Compact Sequences (AECS) based hierarchical time-series clustering that enables compact latent representation of time-series using an undercomplete multilayered Seq2Seq LSTM auto encoder followed by generating of HCs using multiple similarity measures is disclosed. Further, provided is a mechanism to select the best HC among the multiple HCs on-the-fly, based on an internal clustering performance measure of Modified Hubert statistic τ. Thus, the method provides time efficient and low computational cost approach for hierarchical clustering for both on univariate and multivariate time-series. AECS approach provides a constant length sequence across diverse length series and hence provides a generalized approach. | 2021-10-14 |
20210319047 | SYSTEMS AND METHODS ENABLING REAL-TIME PERMISSION BASED PRIVACY PROTECTION OF REAL-TIME LOCATION AND RELATED LOCATION INFORMATION - Systems and methods are provided for enabling uses to instantly access real-time digital content, information, and services related to specific broadcast content or communications based on the specific broadcast area of the communication or the location of the users. Identifiers, communications, and broadcast channels are maintained and dynamically tracked based on geographic location, broadcast areas, date, and time, thereby enabling end users to access such real-time content based on such information, including using broadcast specific identifiers to identify specific communications and obtain additional information over voice and other services based on each specific communication. The system tracks and uses such identifiers, communications, and channels, separately or together with other information known or ascertainable by the systems, to provide users instant access to personalized, location, context, and communications specific, content, information, and services. | 2021-10-14 |
20210319048 | DISAMBIGUATING USER INTENT IN CONVERSATIONAL INTERACTION SYSTEM FOR LARGE CORPUS INFORMATION RETRIEVAL - A method of disambiguating user intent in conversational interactions for information retrieval is disclosed. The method includes providing access to a set of content items with metadata describing the content items and providing access to structural knowledge showing semantic relationships and links among the content items. The method further includes providing a user preference signature, receiving a first input from the user that is intended by the user to identify at least one desired content item, and determining an ambiguity index of the first input. If the ambiguity index is high, the method determines a query input based on the first input and at least one of the structural knowledge, the user preference signature, a location of the user, and the time of the first input and selects a content item based on comparing the query input and the metadata associated with the content item. | 2021-10-14 |