Abstract: A method of restoring an image of a computer, including identifying, by a backup application executing on the computer, artifacts of the computer to back up, creating a mirror image of a hard drive of the computer, wherein the mirror image comprises the artifacts, establishing a local environment within the computer, communicating with a backup server, by the backup application, using the local environment in the computer, backing up the mirror image, by the backup application, to the backup server using the local environment, updating the mirror image, by the backup application, in the backup server in response to a change in the computer, constructing the local environment on the computer in response to an event, loading a program from the local environment, and restoring the computer, by the backup application, from the mirror image in the backup server based on the artifacts, the program, and the restore process.

Abstract: A query is converted into a structured query tokenization. One or more query results visualizations for the query are determined by applying a supervised machine learning model to the structured query tokenization into which the query has been converted. Query results of the query are displayed using the determined query results visualizations.

Abstract: Techniques and mechanisms are disclosed to optimize the size of index files to improve use of storage space available to indexers and other components of a data intake and query system. Index files of a data intake and query system may include, among other data, a keyword portion containing mappings between keywords and location references to event data containing the keywords. Optimizing an amount of storage space used by index files may include removing, modifying and/or recreating various components of index files in response to detecting one or more storage conditions related to the event data indexed by the index files. The optimization of index files generally may attempt to manage a tradeoff between an efficiency with which search requests can be processed using the index files and an amount of storage space occupied by the index files.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing suggestions within a document. In one aspect, a method includes obtaining textual input provided to a document editing application by a user device, the textual input being provided to the document editing application for inclusion in a document; identifying performance measures associated with the current editing session for the document, each performance measure being based on session data obtained from the user device during a document editing session, the session data being for the textual input and prior text that was included in the document prior to the textual input; providing the performance measures as input to a suggestion model that was trained using historical performance measures identified in performance logs for historical document editing sessions of users; and throttling textual suggestions during the current editing session based on the output of the suggestion model.

Abstract: A network device can include a main processor and a packet processor. A method is provided that includes storing a table of values in the packet processor, using the packet processor to receive from the main processor a value that can be used to update the table of values, and using acceleration hardware in the packet processor to update the table of values based on the value received from the main processor without any additional interaction with the software running on the main processor.

Abstract: Techniques are disclosed relating to managing virtual data sources (VDSs), including creating and using VDSs. A virtual data source manager (VDSM) that is executing on a computer system may receive a request to generate a bitmap index for a dataset. The VDSM may then generate a bitmap index by ingesting the dataset into a data format of the bitmap index. The VDSM may further generate the bitmap index by performing a compression procedure on the ingested dataset to generate a plurality of data containers, where a given data container includes a respective compressed portion of the ingested dataset. After compressing the ingested dataset, the VDSM may then store the plurality of data containers in a set of binary trees (b-trees), where the set of b-trees is usable to respond to data requests for data of the bitmap index.

Abstract: According to one embodiment, an information processing apparatus includes an estimator configured to estimate a state of an observation target on a first time, based on data on the first time included in time-series data obtained from the observation target. Also, an information processing method for estimating a state of an observation target on a first time, based on data on the first time included in time-series data obtained from the observation target is provided.

Abstract: Systems and methods are disclosed for processing and executing queries in a data intake and query system. The data intake and query system receives a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system identifies buckets that are to be searched and search nodes to execute the query. The data intake and query system maps the identified buckets to the search nodes and executes the query using the identified bucket and search nodes.

Abstract: A primary query engine may receive a query and determine whether the query is eligible for performance at a secondary query engine. If eligible, the primary query engine may evaluate the availability of the first query engine to perform the query. The first query engine may determine whether to assign the query to the primary query engine or to the secondary query according to availability evaluation. For queries assigned to the secondary query engine, the primary query engine may send a request to the secondary query engine to being processing of the query.

Abstract: Provided are a method and an apparatus for analyzing a malicious code by accurately and rapidly analyzing source code extracted from a set of a plurality of malicious codes, calculating a first degree of complexity of each of a plurality of malicious code binaries, select a root binary initially generated, by using the calculated first degree of complexity, and inferring an evolutionary order of the plurality of malicious code binaries, except for the root binary, based on the calculated first degree of complexity and a degree of distance between the plurality of malicious code binaries.

Abstract: An example operation may include one or more of receiving a set of structured query language (SQL) queries from one or more software applications, generating a set of SQL syntax trees that correspond to the set of SQL queries, identifying a unique subset of SQL syntax trees among the generated set of SQL syntax trees based on previously obtained SQL syntax trees, and transmitting the unique subset of SQL syntax trees to a computing system.

Abstract: Distributed database management systems may maintain collections of items spanning multiple partitions. Index structures may correspond to items on one partition or to items on multiple partitions. Item collections and indexes may be replicated. Changes to the data maintained by the distributed database management system may result in updates to multiple index structures. The changes may be compiled into an instruction set applicable to the index structures. In-memory buffers may contain the instructions prior to transmission to affected partitions. Replication logs may be combined with an acknowledgment mechanism for reliable transmission of the instructions to the affected partitions.

Abstract: Disclosed is an anti-fake packing method for product liability insurance. The method comprises the following steps: providing an anti-fake electronic liability insurance policy for a product; performing coding to the insurance policy; attaching the code to an insurance policy identifier; disposing the identifier on the product; and correspondingly storing the electronic insurance policy, the anti-fake information and the insurance policy number into the database of an insurance policy claiming system. The consumer, when claiming the electronic insurance policy from the policy claiming system using smart phones, unknowingly identifies the genuineness of the insurance policy. According to the method, a high insurance policy claiming rate is transformed into a high anti-fake inspection rate, thereby improving the anti-fake strength and providing a beneficial technical effect desired by domestic and overseas researchers and developers of anti-fake technologies and insurance technologies.

Abstract: Provided is a machine-readable medium storing instructions that when executed by a processor effectuate operations including: receiving, with an application executed by a communication device, a first set of inputs including user data; generating, with the application, a three-dimensional model of the user based on the user data; receiving, with the application, a second set of inputs including a type of clothing garment; generating, with the application, a first set of clothing garments including clothing garments from a database of clothing garments that are the same type of clothing garment; generating, with the application, a second set of clothing garments from the first set of clothing garments based on the user data and one or more relationships between clothing attributes and human attributes; and presenting, with the application, the clothing garments from the second set of clothing garments virtually fitted on the three-dimensional model of the user.

Abstract: A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. Attribute values may be scalars or sets of numbers or strings. The system may provide an API usable to request that values of one or more of an item's attributes be updated. An update request may be conditional on expected values of one or more item attributes (e.g., the same or different item attributes). In response to a request to update the values of one or more item attributes, the previous values and/or updated values may be optionally returned for the updated item attributes or for all attributes of an item targeted by an update request. Items stored in tables may be indexed using a simple or composite primary key.

Abstract: An automated annotation system to automatically designate annotations to records within a report, which may perform operations that include: designating an annotation to a location, the annotation comprising a text string; identifying a record of the location within a report; selecting the annotation based on the record of the location within the report; and applying the text string of the annotation to the record within the report, according to certain example embodiments.

Abstract: Techniques for tracing attributes through queries in a set of nested queries are disclosed. A graphical user interface displays individual sub-queries as separate visual representations. Based on detecting a selection, a system analyzes data underlying the visual representations to identify queries, among the set of nested queries, that are associated with a particular attribute. One selection results in the system analyzing the underlying data to identify an origin query for an attribute, from among the set of nested queries. Another selection results in the system analyzing the underlying data to identify queries, from among the set of nested queries, that use the attribute received from a selected query. Another selection results in the system generating SQL code for a selected subset of queries, among the set of nested queries.

Abstract: A method for profile matching includes receiving a plurality of user profiles, each user profile comprising traits of a respective user. The method includes receiving a preference indication for a first user profile of the plurality of user profiles. The method also includes determining a potential match user profile of the plurality of user profiles based on the preference indication for the first user profile. The method also includes presenting the potential match user profile to a second user.

Abstract: A system and method are presented that improves search results based on skills associated with individuals. The system monitors an individual's contributions to a third-party forum and associates the contributions with skills. The system also monitors learnings received by the individual. Assignments are made to associate the individual with the skills and to assign points. Users request a search based on search skill parameters, and the system uses forum-based data and non-forum data to identify and sort individuals. Skill and point assignments are made temporarily, and assignments are deleted upon the expiration of a time-to-live clock. Save events can permanently save data. Local forum data is also stored and can be used to restore deleted assignments. Points are used to improve avatars used when interacting with searching users.

Abstract: A user preference hierarchy is determined from user response to images. Images may be tagged using machine learning models trained to determine values for images. Products are clustered according to product vectors. Images of products within a cluster are clustered according to composition and groups of images are selected from image clusters for soliciting feedback regarding user preference for products of a cluster. Feedback is used to train a user preference model to estimate affinity for a product vector. A user may provide feedback regarding a price point and products are weighted according to a distribution about the price point. The distribution may be asymmetrical according to direction of movement of the price point. Filters may be dynamically defined and presented to a user based on popularity and frequency of occurrence of attribute-value pairs of search results and based on feedback regarding the search results.

Abstract: Described herein are technologies related to inferring information about a webpage based upon semantics of a uniform resource location (URL) of the webpage. The URL is tokenized to create a sequence of tokens. An embedding for the URL is generated based upon the sequence of tokens, wherein the embedding is representative of semantics of the URL. Based upon the embedding for the URL, information about the webpage pointed to by the URL is inferred, the webpage is retrieved, and information is extracted from the webpage based upon the information inferred about the webpage.

Abstract: Systems and methods for managing content provenance are provided. A network system accesses a plurality of documents. The plurality of documents is then hashed to identify one or more content features within each of the documents. In one embodiment, the hash is a MinHash. The network system compares the content features of each of the plurality of documents to determine a similarity score between each of the plurality of documents. In one embodiment, the similarly score is a Jaccard score. The network system then clusters the plurality of documents into one or more clusters based on the similarity score of each of the plurality of documents. In one embodiment, the clustering is performed using DBSCAN. DBSCAN can be iteratively performed with decreasing epsilon values to derive clusters of related but relatively dissimilar documents. The clustering information associated with the clusters are stored for use during runtime.

Abstract: A system includes an interface and a processor. The interface is configured to receive an indication that a change has occurred to partition data on a first node, wherein the partition data is stored on a partition on the first node. The processor is configured to: determine whether the change to the partition data causes a change to a predetermined partition result of a set of predetermined partition results stored by the partition; and in response to a determination that the change to partition data affects the predetermined partition result stored by the partition: determine a new value for the predetermined partition result; store the new value; and provide an indication to a service node that the new value for the predetermined partition result has been determined, wherein the service node is selected by a client application system to manage execution of a task.

Abstract: In some examples, a database system receives data relating to plural micro-models that apply respective analytics, and distributes a plurality of data segments of the received data across the plurality of processing engines based on values of a segmentation key included in the received data. A plurality of processing engines, performs in parallel, operations associated with the plural micro-models using respective data segments of the plurality of data segments, where different processing engines of the plurality of processing engines perform operations associated with respective micro-models of the plural micro-models.

Abstract: The application discloses a service invoking method, device, apparatus and medium. The service invoking method includes: receiving a first service request message sent by a service invoking end; determining, in response to the first service request message, header information of the first service request message; determining, under a condition that the header information includes a route identification, a target data center among a plurality of data centers according to the route identification; sending the first service request message to the target data center to enable the target data center to provide service for the service invoking end. Based on the embodiments of the application, efficiency of service invoking can be improved.

Abstract: A computer-implemented includes a computing system receiving one or more queries. The computing system includes one or more compute nodes that perform computations for determining a response to at least one query. The system stores, in a storage device, domain data that includes at least one of: a dataset, a metric associated with the domain data, a query time, or a usage pattern that is based, in part, on the one or more queries. The method includes the system generating a distribution model based on analysis of the domain data. The distribution model is generated using machine learning logic executed by the system. The method further includes the system using the distribution model to distribute data to the one or more compute nodes. The distributed data is used to determine, within a threshold response time, the response to the at least one query.

Abstract: A system and method to generate and manage clusters of search terms. The system and method collect a set of search terms associated with multiple search queries relating to an entity. A neural network identifies a set of embedding vectors, wherein each of the set of embedding vectors represents a search term of the set of search terms. A cluster is generated including a portion of the set of search terms based on a comparison of embedding vectors associated with the portion of the set of search terms. A size of the cluster is compared to a cluster size threshold level to determine if a first condition is satisfied. In response to determining satisfaction of the first condition, the cluster is identified as a valid-sized cluster. A user interface is generated to display information related to the cluster and one or more cluster metrics.

Abstract: A method for in-advance obtaining properties of objects of a computerized system, the method comprising receiving a request for properties of a first object, and responsively providing the requested properties along with properties of an at least one another object that are similar to the properties of the first object, wherein the properties of the at least one another object are similar to the properties of the first object by having at least one element of properties that are common therebetween, and wherein the method is carried out by an at least one apparatus component of the computerized system, and an apparatus for performing the same.

Abstract: One embodiment comprises a method in which an integrated multi-user analytics server platform is integrated with a dynamic runtime ETL tool to allow dataflows created or developed in a dynamic runtime environment provided by the ETL tool to be saved in a novel dataflow file container. The method includes: presenting a user interface for an analytics server platform; receiving user input via this user interface indicating an action to be performed as to a first dataflow; the analytics server platform accessing a first file container corresponding to the first dataflow, where the first file container is stored in a data store connected to the analytics server platform; in response to receiving the user input, the analytics server platform accessing APIs of the dynamic runtime ETL tool to initiate the ETL tool, which then performs the action with respect to the first dataflow.

Abstract: A method at a computing device, the method including detecting, at the computing device, a trigger that authentication is pending for an application or service; indicating a state of a credential vault via a user interface of the computing device; and when the credential vault is in a locked state, activating an authentication mechanism for the credential vault without changing focus on the user interface for the application or service.

Abstract: Technologies are described providing adaptive query routing in a replicated database environment. The technologies can be used with a variety of replication protocols. Prepared statements, such as for queries, from a database client can be routed to a source node, or a source node and available replica nodes, when a replica node becomes unavailable. When a replica node becomes available again, a prepared statement can be updated to indicate that the updated prepared statement can be executed at nodes including the replica node that is available again. Prepared statement routing can also be used when a portion of replicated data becomes unavailable at a replica node, but a portion of replicated data remains available.

Abstract: A method and apparatus for selecting database items from a database, where the database items are indexed by a list of item identifiers. The item identifiers may be in the form of text. An initial display is generated which includes one or more parts of the item identifiers. Selection of the one or more parts may be made and results in the generation of a display of a further one or more parts for selection. The further one or more parts may be selected in order to add to the selected one or more parts to build a larger part or whole of an item identifier. Selection from a large list of item identifiers may be carried out in a relatively short time period.

Abstract: A tree-based format may be implemented for data stored in a data store. A table may be maintained across one or multiple storage nodes in storage slabs. Storage slabs may be mapped to different nodes of a tree. Each node of the tree may be assigned a different range of distribution scheme values which identify what portions of the table are stored in the storage slab. Storage slabs mapped to child nodes in the tree may be assigned portions of the range of distribution scheme values assigned to a parent. Storage nodes may be added or removed for storing the table. Storage slabs may be moved from one storage node to another in order to accommodate the addition or removal of storage nodes.

Abstract: In some embodiments, systems and methods for visualizing one or more datasets include importing a plurality of root objects, each root object including linked data attributes and obtaining a joined dataset based on the plurality of root objects, that includes for each or the plurality of root objects, a plurality of rows of related attribute data linked to each root object as a result of a join operation. The systems and methods perform an aggregation computation on the plurality of rows of related attribute data corresponding to each of the plurality of root objects to produce a corresponding single aggregation row of consolidated data for each root object and present a user interface that shows each of the plurality of root objects with their corresponding single aggregation row of consolidated data resulting from the aggregation computation, in a one-to-one manner.

Abstract: Embodiments as disclosed herein allow simple specification of searches of values within regions and efficient implementation of such searches. Specifically, embodiments as disclosed may provide a search operator that addresses the problem of complex query construction for finding objects having a particular value, including a minimum or a maximum value, in one of a set of regions, and the efficient implementation of the searches specified by such search operators.

Abstract: The present application discloses a data read and write method and a distributed storage system. A specific implementation of the method includes: receiving, from a client, by a shard server, a processing request on shard data, the processing request comprising a data identifier of the shard data; processing the processing request based on a hash table pre-loaded in a memory and indicating a correspondence between the data identifier of the shard data and a data index to obtain a processing result; and sending the processing result to the client.

Abstract: A method, according to one embodiment, includes identifying data to be stored in one or more tables within a predetermined portion of a partitioned storage in one of a plurality of nodes, the predetermined portion having at least one replica, and where no two identical replicas reside on a single node; assigning an identifier and a data storage hierarchical level to the data; mapping the data to an index and storing the data in accordance with the index and the data storage hierarchical level, the storing including writing the data to a row in one of the one or more tables on the predetermined portion and recording a write operation into a transaction log of the node; receiving a plurality of write operations; and combining a plurality of write tasks of the predetermined portion for a predetermined time period.

Abstract: Techniques are provided for orphan object detection, invalid sequence number detection, and asynchronous object cleanup. A storage system may store data within one or more tiers of storage, such as a storage tier (e.g., solid state storage and disks maintained by the storage system), a remote object store (e.g., storage provided by a third party storage provider), and/or other storage tiers. Orphan objects, within the remote object store, that are no longer used by the storage system may be detected and/or deleted. When an aggregate of volumes is deleted, corresponding objects, within the remote object store, may be identified and/or deleted. Invalid sequence numbers (e.g., lost or corrupt sequence numbers locally maintained in a metafile) assigned to objects within the remote object store may be identified, deleted, and/or fixed.

Abstract: An illustrated embodiment disclosed herein relates to a hyper converged infrastructure (HCI) having an object storage system (OSS) with an apparatus having a processor with programmed instructions that when executed cause the processor to perform operations. The operations include specifying a first object in the OSS as an executable, specifying a second object in the OSS as an environment on which to run the first object, specifying a third object in the OSS as data to be processed by the first object, and constructing and storing a composite object in the OSS that associates the first, second, and third objects. The composite object provides a technical improvement, providing more direct access to compute resources.

Abstract: Examples of the present disclosure describe systems and methods for ontology-based graph query optimization. In an example, ontology data relating to a graph or isolated collection may be collected. The ontology data may comprise uniqueness and topology information and may be used to reformulate a query in order to yield a query that is more performant than the original query when retrieving target information from a graph. In an example, reformulating a query may comprise reordering one or more parameters of the query relating to resources, relationships, and/or properties based on uniqueness information. In another example, the query may be reformulated by modifying the resource type to which the query is anchored based on the topology information. The reformulated query may then be executed to identify target information in the isolated collection, thereby identifying the same target information as the original query, but in a manner that is more performant.

Abstract: Methods and devices for controlling access to sensitive data stored in a computer system are provided. For at least some data entries in a dataset, each identified by a respective key, an indicator of which zero or more conditions of a plurality of queries are satisfied by that data entry is generated. The keys are grouped into cohorts based on the indicators, at least some of the cohorts comprising keys identifying data entries satisfying the same zero of more conditions. A first output is transmitted to the first computing device comprising an identifier of a first cohort and an indication of a condition which is satisfied by data entries identified by keys in the first cohort. A second output is transmitted to a second computing device comprising an identifier of the first cohort and a set of keys corresponding to the data entries in the first cohort.

Abstract: An apparatus that stores historical data, wherein the historical data comprises a plurality of values for an attribute in which each of the plurality of values are associated with a respective information timestamp and historical timestamp. The system further filters the historical data based on a query, wherein the query is associated with one or more network elements and comprises a designated time. The system further derives values for the one or more network elements at a designated time based on the filtered historical data using at least the respective information timestamps and the historical timestamps. The system further includes based on the derived values, providing a query result, wherein the query result comprises a sequence of events associated with each of the plurality of values for the attribute.

Abstract: A method, apparatus, and computer program product are provided for organizing pedestrian movement data. The method includes receiving a set of travel data. The set of travel data includes one or more pedestrian trips including an origin and a destination. The method also includes generating a pedestrian flow matrix. The pedestrian flow matrix has one or more pedestrian flow compartments. The method further includes assigning at least one of the pedestrian trips to one or more of the pedestrian flow compartments based on the origin and the destination of the given pedestrian trip. Corresponding apparatuses and computer program products are also provided.

Abstract: An illustrative embodiment disclosed herein is an apparatus including a processor having programmed instructions that identify a temporary bucket linked to one or more objects of a main bucket. The processor has programmed instructions that detect that an object is uploaded to the main bucket. The processor has programmed instructions that determine whether the object has an object attribute satisfying an object attribute relationship. The processor has programmed instructions that, if the programmed instructions determine that the object has the object attribute that satisfies the object attribute relationship, add, to the temporary bucket, a link to the object. The illustrative embodiment can reduce latency associated with queries.

Abstract: Various embodiments comprise systems, methods, architectures, mechanisms or apparatus configured for automatically generating a testing script.

Abstract: A data storage system including a virtual server on a network managing a plurality of user accounts, each user account including one or more files; the virtual server adapted to verify user access information for a particular user account; the virtual server transferring over the network information relating to files stored on the virtual server in the particular user account to a verified user on a user computer; the virtual server further adapted to transfer files associated with the particular user account to and from the user computer.

Abstract: A method for message selection, including: receiving a request for unviewed messages, the request identifying a context account, ranking the set of unviewed messages according to ranking criteria, where the ranking criteria is used to rank each of the set of unviewed messages based on an engagement history between the context account and an authoring account of the unviewed messages; generating, based on ranking the set of unviewed messages, a result set identifying a subset of the set of unviewed messages, and providing the result set in response to the request.

Abstract: A backup system having a plurality of accounts for copying selected data between one or more account user computers and a system computer where an account user's computer connects to the system computer via the Internet. Selected data is copied between the account user's computer and the system computer including, documents, media files, and email in any file type or format. Additionally, the system is compatible with all types of computers, including personal data assistants and mobile telephones, and all types of operating systems. All of the software to operate the system is resident on the system computer with no hardware or software required on the account user computer beyond a conventional web browser. The system also includes a scheduler, a contacts manager, a reminder generator and file transfer system for third-party users.

Abstract: Systems and methods for preparing and analyzing data related to geo-spatial properties. A system generates from a first data source, based on an ontology, a geographic dataset including first data objects representative of first data from the first data source and at least one geo-spatial reference based on respective location information from the first data source that corresponds to the first data. The system can also generate a vector map data tile layer based on the ontology using the geographic dataset and including vector map data tiles, having map geometry data linked to the first data objects by a geo-spatial reference, and corresponding to a portion of a geographic area represented by the vector map data tile layer. In response to requests from the front-end system application for first data related to a geo-spatial feature, tiles can be provided and first data corresponding to selected geo-spatial references can be displayed.

Abstract: A query management application provides performing an initial query to retrieve records stored in a database, storing the records as initial query content in a memory, creating a file with a list of commands used during the initial query, initiating a subsequent query to obtain updated information for the records, retrieving the file and applying the list of commands to the subsequent query, performing the subsequent query, and updating the memory with results of the subsequent query.