Abstract: Methods, systems, and computer readable media for recycling order identifiers are disclosed. According to one method, the method occurs at an order management system that utilizes an order database. The order management system includes at least one processor and a memory. The method includes selecting, using an order block data structure, an order slot identifier from a range of order slot identifiers usable in a database partition of the order database, wherein the order slot identifier is reusable; storing order data for an order in the database partition using the order slot identifier; purging the order data in the database partition; and modifying, periodically or aperiodically, the order block data structure to indicate that the order slot identifier is available for reuse, wherein the order block data structure indicates a recycle count associated with usage.

Abstract: A system, method and device for determining and notifying a clinician of information relevant to the clinician. The method that is performed by the device or system includes identifying at least one keyword in a user profile of a clinician, identifying at least one content word in a new information item, determining a relevance score between the new information item and the clinician based on the at least one keyword and the at least one content word and when the relevance score is above a predetermined threshold value, generating a notification for the clinician indicating the new information item.

Abstract: To provide a template search system capable of appropriately searching for templates. In the template search system that manages information of templates and information of nodes used in the templates in an associated manner, provided are: a processing unit that calculates a synonym for an inputted search word and/or a flow showing linkage of the nodes used in the template related to the search word based on the information of the nodes managed by the template search system, and specifies the template associated with the calculated synonym and/or the template having a flow corresponding to the calculated flow based on the information of the templates managed by the template search system; and an output unit that outputs the information of the template specified by the processing unit.

Abstract: Application layering is a technology that separates applications from an operating system image. In some cases, information inside an application layer needs to be modified when that layer is delivered to a computer to be executed correctly in a specific environment. Described is a technique to allow those operations to be defined and executed outside of the operating system that will be running the application layer, so that a single application layer can be delivered to heterogeneous end points without the need to take up additional computation on the guest machine it is being delivered to, to ensure application compatibility when applications reside in more than one layer, to install applications into a layer without knowledge of a specific platform, and to modify the image to provide the required drivers and services to support any platform.

Abstract: Provided is a process that determines a device-dwell graph based on noisy reported geolocations for mobile computing devices.

Abstract: Certain embodiments disclosed herein reduce or eliminate a communication bottleneck at the storage manager by reducing communication with the storage manager while maintaining functionality of an information management system. In some implementations, a client obtains information for enabling a secondary storage job (e.g., a backup or restore) from a storage manager and stores the information (which may be referred to as job metadata) in a local cache. The client may then reuse the job metadata for multiple storage jobs reducing the frequency of communication with the storage manager. When a configuration of the information management system changes, or the availability of resources changes, the storage manager can push updates to the job metadata to the clients. Further, a client can periodically request updated job metadata from the storage manager ensuring that the client does not rely on out-of-date job metadata.

Abstract: Given a skeleton knowledge graph including first terms in respective nodes, wherein first terms in connected nodes have a predetermined relationship, an augmented knowledge graph is formed by a first computing device by extracting a second term from a domain corpus to form a term cluster linked with a respective node of the knowledge graph. The second term is associated with the first term of a respective node in the domain corpus while not meeting the predetermined relationship. A semantic feature between the second term and the associated first term is identified in the domain corpus and linked to the pair of the second term and the first term in the augmented knowledge graph. The augmented knowledge graph is useable by a second computing device, which may or may not be the same as the first computing device, to drive a conversation between a chatbot and user.

Abstract: A system receives, from a content source, product information that can comprise core product data for the product and a product identification for the product. The one or more derived attributes that can be based at least on a respective use case of one or more uses cases that affects the one or more products presented in a content catalog. The content feed can merge the at least one of the one or more derived attributes with the product information to update the product information in the content feed based on matching the product identification for the product with the one or more derived attributes. Other embodiments are disclosed.

Abstract: A method for identifying a level of similarity between binary vectors includes storing, by a processor on a computing device, in each of a plurality of memory cells on the computing device, one of a plurality of binary vectors, each of the plurality of memory cells including a bitwise comparison circuit. The processor provides, to each of the plurality of memory cells, a received binary vector. Each of the bitwise comparison circuits determines a level of overlap between the received binary vector and the binary vector stored in the memory cell associated with the bitwise comparison circuit. Each of the comparison circuits that determines that the level of overlap satisfies a threshold provides, to the processor, an identification of the stored binary vector with the satisfactory level of overlap. The processor provides an identification of each stored binary vector satisfying the threshold.

Abstract: Metadata is replicated. For instance, in response to receiving a request for replicating metadata to a target node, information of an index structure associated with the metadata is obtained. The index structure may include terminal nodes for storing the metadata and index nodes for storing index information of the terminal nodes. Next, the metadata from the terminal nodes is extracted based on the information of the index structure. Further, a sequence is generated to be replicated of the metadata. The sequence to be replicated includes items of the metadata, and locations of the items in the sequence to be replicated are determined based on key information corresponding to the items. In addition, the items of the metadata, in the sequence to be replicated, are replicated to the target node. In this way, only the metadata in the index structure is replicated, thereby reducing the data amount of replication.

Abstract: A method is provided. The method comprises receiving a search query that is part of a search conversation, the search query in an unstructured format; identifying a first list of facets with a first list of associated values from the search query; deriving a second list of facets with a second list of associated values from the first list of facets based on a context of the search query within the search conversation; generating a database query based on the second list of facets with the second list of associated values; causing a database search with the database query; transmitting a search result of the database search to a sender of the search query, wherein the method is performed by one or more computing devices.

Abstract: Approaches herein transparently delegate data access from a relational database management system (RDBMS) onto an offload engine (OE). The RDBMS receives a database statement referencing a user defined function (UDF). In an execution plan, the RDBMS replaces the UDF reference with an invocation of a relational operator in the OE. Execution invokes the relational operator in the OE to obtain a result based on data in the OE. Thus, the UDF is bound to the OE, and almost all of the RDBMS avoids specially handling the UDF. The UDF may be a table function that offloads a relational table for processing. User defined objects such as functions and types provide metadata about the table. Multiple tables can be offloaded and processed together, such that some or all offloaded tables are not materialized in the RDBMS. Offloaded tables may participate in standard relational algebra such as in a database statement.

Abstract: Some embodiments include a method for identifying named entities in a question received in a question and answer system. The method can include receiving the question and constructing, via a named entity controller, a search query using all words in the question. The method can also include searching a named entity index for records that include named entity fields associated with certain of the words in the question. The method can also include determining a search score for each of the records based, at least in part, on how closely words in the question match a field of the record. The method can also include determining a weighted score for each of the records based on where the words in the question are positioned in the question. The method can also include creating a list of records including one or more of the records whose weighted score is above a threshold score. The method can also include providing the list of records for use in answering questions in the question and answer system.

Abstract: In an embodiment, a method comprises receiving a request to deploy one or more blockchain nodes in a blockchain network. The request includes one or more parameters of a plurality of parameters. The one or more parameters comprise one or more cloud infrastructure providers, one or more regions and a blockchain protocol. A mapping that associates each parameter of the plurality of parameters with a subset of cluster configuration data is used to generate a first message based on the one or more parameters received in the request. Cluster configuration data comprises programming interface (API) information for a plurality of cluster, authentication information for the plurality of clusters and additional configuration data for the plurality of clusters. A second message is generated based at least in part on the first message and deployment configuration data. The deployment configuration data comprises digital data used to deploy the one or more blockchain nodes to the target cluster.

Abstract: A method for resource search and related products are provided. The method is applicable to a server and includes the following. A search request is received from a mobile terminal, where the search request includes a target search term. Search for a target search result set from a preset application library according to the target search term. The target search result set is pushed to the mobile terminal and the mobile terminal is instructed to display the target search result set, when the target search result set has a conversion rate greater than a first threshold value, where the target search result set is displayed with preset display contents, and the preset display contents at least include a conversion rate.

Abstract: An arena-based memory management system is disclosed. In response to a call to reclaim memory storing a plurality of objects allocated in an arena, a garbage collection of the arena is triggered based on heap-related parameter. A live object of the plurality of objects is preserved with the garbage collection.

Abstract: The disclosed technology provides for sharing of collections between teams from external entities. The present technology allows administrators of an entity to manage what teams from their entity can be exposed outside of the entity and to manage how their entity is viewed by external partners. Sharing between teams provides benefits of easier sharing whereby it is not necessary to share a collection individually with all users of a team. It also provides a more logical sharing paradigm where collaboration is otherwise thought of between two partner entities and not specific employees of those entities. Sharing between teams allows an administrator to manage the user accounts associated with the team so that as team members come and go, all current team members will have access to projects in which the team is involved. Additionally, established teams can be configured to enjoy the full collaborative benefits of the content management system.

Abstract: Representative embodiments set forth herein disclose techniques for implementing dynamic file system volumes that can share storage space with other file system (FS) volumes within the same partition/storage device. According to some embodiments, techniques are disclosed for establishing an FS volume within a container. According to other embodiments, techniques are disclosed for handling input/output (I/O) requests across different FS volumes. According to yet other embodiments, techniques are disclosed for efficiently establishing, within a storage device, an FS volume from an image of the FS volume.

Abstract: A method, according to one embodiment, includes identifying data received or generated by one of a plurality of nodes; replicating the data to a plurality of storage components; receiving, at a first node of the plurality of nodes, a request for the data; determining that a cache of the first node does not include the data; identifying a second node of the plurality of nodes that has an identifier indicating that the data is stored in the second node; requesting that the second node of the plurality of nodes service the request; determining that the second node of the plurality of nodes has not responded to the request; identifying a third node of the plurality of nodes that has the identifier; requesting that the third node of the plurality of nodes service the request; retrieving the response to the request; and providing the data to the first node.

Abstract: A method of data query based on an evaluation and a device. The method includes: obtaining evaluation data of entities and basic information of the entities from multiple websites; extracting labels of the entities according to the evaluation data of the entities and the basic information of the entities; filtering the evaluation data of the entities; aggregating to obtain evaluation data of the same type of entities having the same label according to the basic information of the entities, the labels of the entities and the filtered evaluation data of the entities; and making a query to obtain information on a target entity according to a retrieval statement and the aggregated evaluation data of the same type of entities for each label. The method can make a query for information on a type of entities for a user, so that the user can compare the entities.