Abstract: A client computing device receives a behavior model corresponding to a user group associated with a user. The behavior model has been trained with monitored user interactions of one or more files associated with the user group. The client computing device further mounts a snapshot of a file and determines, based on the behavior model, which files of the mounted snapshot to transfer to a locally accessible cache. During use of the client computing device, the client computing device may determine whether the mounted snapshot is accessible. If the mounted snapshot is not accessible, the client computing device may selectively delete, based on the behavior model, one or more of the files stored in the locally accessible cache. If the mounted snapshot is accessible, the client computing device may update the one or more files of the locally accessible cache with monitored user interactions with the mounted snapshot.

Abstract: The present disclosure involves systems, software, and computer implemented methods for key pattern management. One example method includes receiving a query for a logical database table from an application. A determination is made as to whether the query is a write query. In response to determining that the query is a write query, a determination is made as to whether the query complies with a key pattern configuration that describes keys of records included in a physical database table that is part of a logical table implementation. The physical table includes records of the logical database table that are allowed to be written by the application. The write query is redirected to the physical database table in response to determining that the query complies with the key pattern definition. The query is rejected in response to determining that the query does not comply with the key pattern configuration.

Abstract: Embodiments of the present disclosure provide for the synchronous distribution real-time and historical farming data to user client devices via shared and personal interface rooms. In some embodiments, multiple users can be connected to a shared interface room corresponding to a data collection device to view real-time and historical farming data simultaneously. The shared interface room can then broadcast farming data to each user whenever real-time farming data is received. Historical farming data can be determined based on a pair of timestamps corresponding to data collection device activity and user activity. When one of the connected users requests to view historical farming data, the historical farming data can be provided to the requesting user via a personal interface room.

Abstract: Systems and methods for generating a data aggregator interactive graphical user interface. An interactive graphical user interface (GUI) includes a selectable symbol region, a query region and a data results region. The selectable symbol region displays predefined symbols. The query region displays user input fields for generating queries. The system receives user input associated with the user input fields of the query region to form a filter set. The data results region is automatically updated responsive to the user input, to display one or more data values from among one or more databases associated with the filter set. The system receives a subscription request to save the filter set as a user-customized query. A custom symbol is created responsive to the subscription request that is associated with the filter set. The the selectable symbol region is updated to display the custom symbol together with the predefined symbols.

Abstract: A determination device according to the present application has an acquisition unit, a categorization unit, and a determination unit. The acquisition unit acquires the search queries, which have been input by a plurality of input customers who have input a reference query. The categorization unit categorizes the search queries, which have been input in a predetermined period among search queries, into a plurality of categories. The determination unit determines whether a categorization result by the categorization unit satisfies a predetermined determination condition or not.

Abstract: The method of no fail searching may include receiving a set of keywords from an input set of search fields within a GUI, retrieving a set of search results based on the set of keywords from the input set of search fields, organizing the set of search results according to a set of content types, ranking each search field according to the set of content types, removing the lowest ranked search field from the set of keywords to create a broadened set of search fields when at least one content type has zero results, repeating the retrieving, organizing, ranking, and removing steps until either each content type contains a threshold amount of search results or all search fields have been removed, wherein the broadened set of search fields is used as the input set of search fields in subsequent retrieving steps.

Abstract: A computer-implemented method of retrieving and displaying data from an entity network database (130) comprising a plurality of entities and a plurality of relationships between the entities is provided. The method comprises receiving a selection of a plurality of anchor entities of the entity network database; retrieving a plurality of connector entities of the entity network database, each connector entity disposed on a path in the entity network database extending between at least two of the anchor entities; determining a relevance score for each of the connector entities, the relevance score reflecting the relevance of each connector entity to the anchor entities; and displaying the connector entities within a shape defined by the anchor entities, wherein the distance of each connector entity from the anchor entities is based on the relevance score of the connector entity.

Abstract: Disclosed is a method, a device and equipment for fusing different instances describing the same entity. The method includes: acquiring a connection diagram comprising a plurality of instances, where different nodes in the connection diagram represent different instances, and connection lines between the nodes represent instance relations between the instances corresponding to the nodes; based on the instance relations, identifying different instances describing the same entity in the connection diagram, fusing the nodes corresponding to the identified instances, and updating the connection diagram.

Abstract: There is provided a method for searching a plurality of information sources using a multimedia element, the method may include receiving at least one multimedia element; generating, by a signature generator, for the at least one multimedia element at least one signature that is unidirectional, and yields compression; generating at least one textual search query using the at least one signature; wherein the generating of the textual search query comprises: (a) searching for at least one matching stored signature that matches one or more of the at least one signature; and (b) using a mapping between stored signatures and textual search queries, selecting at least one textual search query mapped to at least one matching stored signature; searching the plurality of information sources using the at least one textual search query; and causing a display of search results retrieved from the plurality of information sources.

Abstract: A system and method for improving the performance of an issue management system is disclosed. The system includes a server communicating with an issue management database and a client running on a remote device such as a mobile phone. The client provides a user interface for making queries of the issue management database. Users can select filtering parameters to narrow the query space. Upon receiving a user query the system can request information from server and the issue management database related to the query and the filtering parameters. Using the response from the server and database the client can build a partial database that is stored locally. Further user queries are performed on the partial database rather than the full server-side database to enhance performance and response time of the system.

Abstract: Embodiments of the present disclosure relate to systems and methods for preparing a data set for searching. In addition, embodiments of the present disclosure relate to solutions for configuring a storage infrastructure and indexing process for a data set.

Abstract: A UUID generation method for a distributed graph database, and a data processing method and apparatus for the distributed graph database. The UUID generation method for the distributed graph database comprises the following steps: receiving a UUID generation request, wherein the UUID generation request comprises an input field and a partition number of the input field; calling a Murmur hash function to generate an initial UUID according to the input field and the partition number of the input field; querying whether a duplicate key value exists between the initial UUID and a historical UUID to obtain a query result; and obtaining a target UUID for storage according to the query result and the initial UUID.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for determining an increased matching for large graphs in which an increased matching is generated for the graph by leveraging an initial matching for a small fraction of edges of the large graph. An initial matching for a random subset of edges of an input graph is leveraged to generate alternating paths based on the initially matched edges and the remaining edges, not included in the random subset. An increased matching for the entire graph includes the alternating paths without the initial matched edges, thus increasing the number of matched edges in the increased matching by at least one for every initially matched edge. Graph-based tasks may then be triggered based on the increased matching.

Abstract: An automated data entry system comprising target database servers for storing target database(s), a processing server configured to execute a client-application and configured to store a plurality of data objects including a document schema and a target database schema corresponding to the target database(s), and a client terminal connected to the processing server, configured to: generate a first graphical interface for connection to a target database, and to execute a second graphical interface for connection to the client-application. The processing server may also receive an electronic data file representing an unprocessed document, to associate the unprocessed document with a document schema and extract a data variable based on the document schema, and to generate a database operation comprising the data variable configured according to a target database schema.

Abstract: There is a need for more effective and efficient data modeling and/or data visualization solutions. This need can be addressed by, for example, solutions for performing data modeling and/or data visualization in an effective and efficient manner. In one example, solutions for generating a data model with dynamic relational awareness are disclosed. In another example, solutions for processing data retrieval queries using data models with dynamic relational awareness are disclosed. In yet another example, solutions for generating data visualizations using data models with dynamic relational awareness are disclosed. In a further example, solutions for integrating external data objects into data models with dynamic relational awareness are disclosed.

Abstract: The example embodiments are directed to a system and method that applies knowledge developed by a subject matter expert with respect to a physical asset. In one example, the method includes receiving knowledge and issue resolution information developed of subject matter experts in association with historical issues for an asset, generating a plurality of data clusters for the asset based on the knowledge, wherein each historical issue of the asset is mapped to a cluster and includes a plurality of resolutions for the issue, receiving a new issue and new issue information, and processing the new issue by extracting keywords from the new issue information and assigning the new issue to a data cluster from among the plurality of data clusters based on the extracted keywords, and outputting, to a display, a cause of the new issue and potential solutions for the new issue.

Abstract: Technologies including computer implemented methods and systems are described herein for providing instantiation of virtual machines from backups. Systems and methods disclosed herein do not require restoring the complete contents of a virtual machine from a backup prior to using the virtual machine. Systems and methods presented herein allow creating and running a virtual machine directly from a virtual machine backup. Virtual machines created and maintained by the virtual machine instantiation system may be, in turn, used for backup consistency testing, disaster recovery testing, or granular item-level restore.

Abstract: One or more systems and methods are presented for secure data communications utilizing blockchains. One or more systems and methods may utilize multiple blockchains to provide an immutable cryptographically linked set of blocks. Each of these blocks may contain one or more actions associated with a computer network. In one embodiment, a trusted third party may be utilized to authenticate and/or verify data prior to inputting data into one or more blockchains.

Abstract: A POI recommendation method based on the graph database includes: acquiring an ID and positioning information of a target user; according to the ID and the positioning information of the target user, acquiring a feature vector of the target user, a friend intimacy coefficient of the target user and a target POI set from a target graph database, wherein the target POI set is a set composed of POIs within a preset distance range queried according to the positioning information; according to the target POI set, acquiring a feature matrix of a user set with related POI consumption records from the target graph database, wherein the related POI consumption records are consumption records associated with any POI in the target POI set; and according to the friend intimacy coefficient, the feature vector of the target user and the feature matrix, determining a target POI from the target POI set.

Abstract: Techniques are described for fulfilling resources demand dynamically. In one example method, a query associated with a request of a demand fulfillment analysis associated with an identification of a plurality of potential persons related to a demand is received. The received query is analyzed to determine an intent of the demand. Based on the determined intent of the demand, algorithms to be applied to an underlying data set are identified, where the underlying data set comprises a collected set of information from a plurality of source systems. The identified algorithms are applied to the underlying data set based on a set of parameters associated with the received query to generate an updated data set from the underlying data set. The updated data set is then clustered to generate a result set from the underlying data set, and a visualization of the result set is generated for presentation.