Abstract: A system and methods are disclosed for determining the ideal times for a person, software client, or other entity to post a message to a social networking site. An ideal time is a time when the post will have a maximum impact, where impact is some measure of success as defined by the posting entity. To determine the ideal times, the posting patterns of individual users are aggregated in a weighted fashion, taking into consideration both the entity's desired impact and the likelihood that the user will be online and able to view the post within a specified time frame.

Abstract: Nodal redundancy storage decisions efficiently distribute redundant copies of electronic data. A cloud computing network establishes a policy that governs how and where the redundant copies are stored within the cloud computing network (such as by region, zone, and cluster targets). Each cloud computing node is then delegated, with autonomy, to manage a redundant copy to achieve the policy established by the cloud computing network. Each cloud computing node may independently and individually decide to store, to not store, or to evict the redundant copy without consensus of other nodes and without consultation or instruction from the cloud computing network. The nodal redundancy storage decisions are thus decentralized from region, zone, and cluster management.

Abstract: A method for detecting a private set intersection includes receiving a first plurality of transformed data elements from a first computing device, the first plurality of transformed data elements representing a transform by a pseudorandom function of a first plurality of data elements; receiving a second plurality of transformed data elements from a second computing device, the second plurality of transformed data elements representing a transform by the pseudorandom function of a second plurality of data elements; and transmitting, by a processing device to the first computing device and the second computing device, an indication of a subset of transformed data elements that are present in both the first plurality of transformed data elements and the second plurality of transformed data elements.

Abstract: A first relative frequency distribution in original data is calculated for each of feature amounts. Data segments are cut out from the original data using time windows. A second relative frequency in extracted data is calculated for each of the feature amounts. An error between the first relative frequency distribution and the second relative frequency distribution is calculated. A trial from determination of a setting of time windows to calculation of the error is repeatedly executed while changing the setting of the time windows. One or more settings of the time windows in which the error is less than a threshold value are selected and output.

Abstract: The present patent application discloses a data analytics system with a split plane architecture that utilizes a workflow management module in a control plane for cloud-based computing. The system receives workflow files from client devices and stores those workflow files in a cloud storage associated with the user. The data plane, which executes the workflow file, retrieves the file directly from the cloud storage or through an API provided by the workflow management module. A workflow engine wrapper, containing a stager system and an execution system, prepares workflow files for execution and stores generated results in the cloud storage.

Abstract: System and method for trackable applications including an application providing unit, a controller, and an incentive tracker. The application providing unit is adapted to send a trackable application upon request. The controller is adapted to receive interactions from the trackable application. The incentive tracker is adapted to select an incentive based on the interaction data. The controller is further adapted to send the selected incentive to the trackable application.

Abstract: A document re-finding system generates embeddings for concept clips provided by a user, the concept clips defining a concept for searching for content of interest to the user in a plurality of documents previously seen by the user. The re-finding system determines semantic relationships between the concept and document clips, related to respective document among the plurality of documents, based on the concept embedding and embeddings generated for the document clips. A graphical user interface depicting the semantic relationships is rendered to the user and is operable to enable re-finding a document, among the plurality of documents, having the content of interest to the user.

Abstract: An information processing apparatus and method, and a program, which are capable of conducting a search more easily and at a higher speed. The information processing apparatus includes a control unit configured to designate a designated section and a designated sound source of an audio signal including sounds of a plurality of sound sources, and configured to obtain a search result of a sound source signal similar to a signal of the designated sound source, the sound source signal having been searched for on the basis of the signal of the designated sound source in the designated section of the audio signal. The present technology is applicable to the information processing apparatus.

Abstract: A computing machine receives a plurality of observations. The computing machine generates an observation data structure. The computing machine extends, in accordance with the causal structures and hierarchical relationships, the observation data structure to include predicted states or predicted actions that are not from the plurality of observations. The computing machine reduces, in accordance with consistency rules stored in a memory of the computing machine, the extended observation data structure. The computing machine provides an output associated with the reduced observation data structure.

Abstract: A computer-implemented method, system and computer program product for generating a visual transformation of a business analytic artifact. Features from a received business analytic artifact (e.g., dashboard) are extracted. Furthermore, constraints are determined for a transformed representation of the business analytic artifact. A heuristic-based search is then performed on a space of possible transformed representations of the business analytic artifact using the extracted features to identify a transformed version that satisfies the determined constraints and maximizes readability. A final score is then generated for each possible transformed representation of the business analytic artifact based on the extent that the transformed version satisfies the determined constraints and maximizes the readability. The transformed representation of the business analytic artifact that has the highest score is selected and displayed on the target device.

Abstract: Method for controlling data quality assurance after a migration between a source repository, which includes source data associated with a source data structure, and a target repository, which includes target data associated with a target data structure, according to migration rules. The target data is organized as a set of elements. The method includes simulating the migration by applying migration rules to source data so as to output simulated data according to the target data structure, where the simulated data is organized as a set of elements. The method includes merging the simulated data and the target data by excluding identical elements, to form an input vector for a machine learning algorithm. The method includes applying the machine learning algorithm for pairing elements of the input vector according to a similarity score and determining a discrepancies indicator according to the similarity score for each element of the input vector.

Abstract: Techniques are described herein for address matching from a single address string to an address matching score. In an embodiment, an address string is received and parsed into parsed address data. Once an address string is parsed into parsed address data, the parsed address data is standardized by converting the parsed address data into a standard format and replacing abbreviations, colloquial names with formal names. Once an address string has been standardized into a standardized street locale, candidate addresses that are identical to or similar to the standardized street locale are identified and are assigned a score. Each score comprises a probability that the respective candidate address and the standardized street locale represent a same place or location.

Abstract: Systems and methods for monitoring and managing versioning changes to computational workflows caused by ongoing development of computational modules implemented within the computational workflows. Exemplary implementations may: store a workflow repository and a user repository; monitor the workflow repository to detect changes to computational modules included in the workflow repository; responsive to detections of changes to the computational modules, identify computational workflows defined by workflow definitions impacted by the detected changes; identify, based on information included in the user repository, users associated with the identified computational workflows; manage information defining user interfaces associated with individual users; update information defining the user interfaces based on the detected changes and the identified users; effectuate presentation of the user interfaces to the users; and/or other exemplary implementations.

Abstract: A method is provided that includes establishing, by an application server, a remote access session with a client device, and creating, by a file system agent running on the application server, a metadata-only virtual file system associated with the remote access session, wherein the virtual file system only comprises file metadata associated with a plurality of files residing in a local file system of the client device. The method further includes responsive to receiving, by the virtual file system, a request to access content of a file referenced by the virtual file system, redirecting the request to a file system driver implementing at least a sub-tree of the local file system of the client device.

Abstract: A system is provided for intelligent and integrated preservation of multiple electronic data records within a distributed electronic data register. In particular, the system may use a stacked data structure within the distributed register that allows data records or blocks within the distributed register to include multiple links or pointers (e.g., hash values) to previous blocks, where such previous blocks may be linked to a single parent block. By using such a multi-link data structure, the system may prevent the waste of energy and/or computing resources associated with the computational work of the nodes for submitting blocks to be appended to the distributed register. The system may further use a two-pointer algorithm for traversing the multi-link distributed register, thereby providing for an efficient way to search for specific data records. In this way, the system provides a more secure and efficient way to store data within a distributed register.

Abstract: A method of operating a search service includes observing, on a per-user basis with respect to each user in a group of users, usage of features of a search engine over a period of in association with search queries submitted to the search engine. The method continues with identifying, on a per-user basis with respect to each of the group of users, one or more insights into the usage of the features over the period of time. The service may then enable display of the one or more insights in a user interface.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and cause the one or more processors to perform acts of: in response to receiving search queries at a search engine, storing search event data and ranking features in one or more databases; generating, using the search event data and the ranking features, a training dataset comprising training event samples; executing a hybrid labeling procedure that assigns labels to the training event samples based, at least in part, on individual engagement information associated with the training event samples; and training a personalized ranking model to rank search results using the training event samples and the labels. Other embodiments are disclosed herein.

Abstract: Systems and methods for counteracting data-skewness for locality sensitive hashing via feature selection and pruning are disclosed. In one embodiment, a method for feature selection for counteracting data skewness on locality sensitive hashing (LSH)-based search may include: (1) ingesting, by an ingestion computer program and from a plurality of data sources, data; (2) extracting, by the ingestion computer program, a plurality of features from the ingested data; (3) transforming, by the ingestion computer program, each of the plurality of features into a feature vector; (4) selecting, by the ingestion computer program, a subset of the plurality of features; and (5) for each selected feature vector: computing, by the ingestion computer program, a random hash function for the selected feature; and inserting, by the ingestion computer program, an output of the random hash function into a hash table with the selected feature.

Abstract: Provided are a method, system, and device for a neural architecture search (NAS) pipeline for performing an optimized neural architecture search (NAS). The method may include obtaining a first search space comprising a plurality of candidate layers for a neural network architecture; performing a training-free NAS in the first search space to obtain a first set of architectures; obtaining a second search space based on the first set of architectures; performing a gradient-based search in the second search space to obtain a second set of architectures; performing a sampling method search utilizing the second set of architectures as an initial sample; and obtaining an output architecture as an output of the sampling method search.

Abstract: The present disclosure describes techniques of storing and accessing multimedia files. The techniques comprise obtaining at least two multimedia files; performing format parsing for each of the at least two multimedia files separately to obtain audio encoding data, video encoding data, and container format data of each of the at least two multimedia files; storing the container format data of each of the at least two multimedia files separately, and storing one copy of the audio encoding data and video encoding data; and generating and storing index data comprising information of identifying encoding offset of the container format data, the audio encoding data, and the video encoding data in each of the at least two multimedia files, and comprising information indicative of storage address of the container format data, the audio encoding data, and the video encoding data of each of the at least two multimedia files.