Abstract: A computer-implemented method for storage of digital information data via at least one processing unit (110) operatively coupled to at least one database is proposed. In at least one embodiment, the method comprises: providing at least one portion of the digital information data; performing at least one syntactic and/or semantic search in the at least one database based upon the portion of the digital information data; providing one or more meta-data strings in response to the at least one syntactic and/or semantic search; receiving at least one relevant meta-data string; and storing the portion of digital information data and the at least one relevant meta-data string. In at least one embodiment, the at least one relevant meta-data string is usable for a future syntactic and/or semantic search.

Abstract: A graph model of a graphical user interface (GUI) may be generated by processing usage data of the GUI where the usage data comprises sequences of GUI pages and actions between GUI pages. The nodes of the graph model may be determined by obtaining GUI pages from the usage data, identifying dynamic GUI elements in the GUI pages, generating canonical GUI pages by modifying the GUI pages using the dynamic GUI elements, and creating graph nodes using the canonical GUI pages. The edges of the graph may be determined by processing actions from the GUI data that were performed by users to transition from one GUI page to another GUI page. The graph model of the GUI may be used for any appropriate application, such as determining statistics relating to the GUI or statistics relating to individual users of the GUI.

Abstract: Techniques are disclosed relating to natural language processing. In some embodiments, a computer system receives unlabeled content. In some embodiments, the computer system embeds, using a machine learning model, the unlabeled content, where the embedding generates an unlabeled vector. In some embodiments, the computer system determines, from a plurality of labeled vectors stored in a vector index, a first set of labeled vectors that match the unlabeled vector, where the first set of labeled vectors are generated from a set of labeled content stored in a database. In some embodiments, the computer system assigns a new label to the unlabeled content, where the new label is selected from the first set of labeled vectors. In some embodiments, the computer system stores the newly labeled content in the database. The disclosed techniques may advantageously provide for automatically labeling content based on its semantic rather than its syntactic meaning.

Abstract: Splitting a natural language sentence into primitive phrases retaining relations of terms includes receiving a natural language sentence, building a parse tree from the natural language sentence using a natural language parser, and recursively identifying discourse markers in subtrees of the parse tree, starting with the highest ranking discourse marker in the parse tree, thereby separating each of the respective subtrees at the respective discourse marker using a set of predefined rules until a set of basic subtrees remains. The recursive identification includes looking-ahead for identifying long ranging discourse markers before identifying local discourse markers.

Abstract: In some embodiments, apparatuses and methods are provided herein useful to searching retail products for purchase and locations of physical retail stores. In some embodiments, there is provided a system for searching both retail products for purchase and locations of physical retail stores including a user interface; a universal search bar cooperatively operating with the user interface to provide a single search tool for a customer to search one or more databases storing at least retail product inventories and a plurality of retail locations; and a control circuit configured to: receive a communication signal to initiate operation of the user interface.

Abstract: Embodiments of systems and methods for storing documents in a cloud storage system comprising a cloud processor and a plurality of storage components are disclosed.

Abstract: Systems, devices, media, and methods are presented for identifying and categorically labeling objects within a set of images. The systems and methods receive an image depicting an object of interest, detect at least a portion of the object of interest within the image using a multilayer object model, determine context information, and identify the object of interest included in two or more bounding boxes.

Abstract: Technology is described for identifying topical arguments to be provided in order to enable problem solving. The method can include a first operation of storing a topical problem statement at a root of a graph. A plurality of topical arguments may be stored in a plurality of argument nodes and user answers to the topical arguments in the graph. Another operation may be grouping the argument nodes into section groups that define a sub-topic linked by the graph to the topical problem statement. Additionally, use requests for the topical arguments in the graph may be tracked by recording access to the topical arguments. A use pattern of topical arguments may be identified by tracking use requests to the topical arguments. The use pattern may be processed using a machine learning model.

Abstract: A method and server for ranking a plurality of documents are disclosed. The method includes determining, by the server, for each document from the plurality of documents a proximity value between a respective document vector and an other document vector. A given proximity value for a respective document being indicative of a similarity between (i) the respective document and (ii) at least one other one from the plurality of documents. The method also comprises using, by the server, the proximity values of the plurality of documents for ranking the plurality of documents.

Abstract: An efficient blend of home/personal and work/productivity related content based on a user's intent is provided, wherein the user's intent can be determined based on context information, learned user interaction patterns, and historical work and home characteristics and patterns. The system is individualized to the user and operative to generate a user experience that provides a blend of relevant home/personal and work/productivity related information to the user based on the user's current work and life characteristics. From a determined user intent, various aspects provide personalized computing experiences tailored to the user and, in some examples, incorporation of the user's patterns into an efficient blend of personal and productivity workflows.

Abstract: Systems and methods are disclosed for finding intersections between digital interactions of two users (or a user and specific data) based on two different digital interaction data sets. For example, a digital interaction database may include a first user's mobile phone records from a first mobile company and a second user's mobile phone records from a second mobile phone company. The first user's mobile phone records and the second user's mobile phone records may be organized differently, may have different data elements, may have different format styles, etc. Yet an intersection between the first user and the second user may be found by searching the first user's mobile phone records and/or the second user's mobile phone records and retrieving related digital interactions such as, for example, phone records showing a phone call or message between the first user and the second user.

Abstract: A notification system is described herein. Notifications can be generated for groupings of devices. A notification indication can be sent to a larger grouping of client devices. The notification indication can include one or more grouping parameters that specify one or more conditions that define a smaller device grouping. Devices that fall within the grouping can request the notification from a messaging service or management service.

Abstract: A group-based communication platform is configured to ascertain the relatedness of various work objects shared among users of the group-based communication platform. Moreover, the group-based communication platform may further receive and process work objects originating from non-users of the group-based communication platform, thereby further expanding the utility of the determined relatedness between work objects. These work objects (or encrypted representations of these work objects) may be indexed and stored in association with the group-based communication platform, thereby enabling users to search for and retrieve work objects originating from a plurality of work object sources simultaneously, and based on various characteristics of those work objects and the determined interrelatedness between various work objects.

Abstract: A filtering method and system. The method includes receiving by a computer processor an audio/video data file and filtering data. The computer processor analyzes the filtering data with respect to the audio/video data file and retrieves specified audio/video data portions comprising data objects within frames of the audio/video data file. The computer processor removes gaps existing in the audio/video data file and receives tags comprising instructions for presenting video data of the audio/video data file, audio data of the audio/video data file, and the specified audio/video data portions. The computer processor stores the video data in a first layer of a multimedia file, the audio data in a second layer of the multimedia file, and the specified audio/video data portions in additional layers of the multimedia file. Each of the first layer, the second layer, and the additional layers comprises a tag layer comprising the tags.

Abstract: A database query gateway includes a query request interface configured to receive a query request and extract query parameters from the query request and a database endpoint interface configured to modify a stored query based on the query parameters, to transmit the modified query to a database endpoint, and to receive from the database endpoint query results based on the modified query. The database query gateway further includes a reporting engine interface configured to convert the query results into a reporting engine format.

Abstract: A computer-based apparatus for searching confidential documents, including a computer with a memory element and a processor to execute instructions stored in the memory to receive a confidential document and related non-confidential information from a source entity. The processor executes the instructions to: store the confidential document and non-confidential information in the memory element; and restrict access to the confidential document stored in the memory element to the source entity and a library entity only, or to the first source entity only. The processor executes the computer readable instructions to: receive a search request from a searching entity including a search parameter; identify the search parameter as being applicable to the confidential document; and transmit for access by the searching entity, the non-confidential information. The library entity is different from the source entity.

Abstract: Embodiments of the invention provide systems and methods for managing catalog information that can include tracking and reporting search terms used for catalog items searches. According to one embodiment, a procurement application can maintain a log of unique search phrases which returned no search results. For example, the log can maintain records from a specific time period. A count can be maintained to capture how many times a phrase was used for search within the specific time period, and used to rank the frequency of the search phrases. Search phrases that exceed that time period may be purged. The accumulated counts and associated search terms can be provided to the managers periodically and/or upon request in the form of a summary or other graphical and/or textual report or presentation.

Abstract: A method for improving the usability of product feedback data can begin with the receipt of product feedback search parameters by an intelligent product feedback analytics tool. The product feedback search parameters can represent a product or a group of products. Product feedback search results having a rating value and/or textual feedback content can be obtained for the product feedback search parameters. For each product in the search results, a composite rating value can be synthesized from the rating values contained in the search results. For each product in the search results, the product feedback search results can be analyzed for analytic parameters using natural language processing techniques. An analytic parameter can represent a commonality within a subset of the search results. The product feedback search results, composite rating values, and analytic parameters can be presented within a user interface, providing context for the composite rating value.

Abstract: Embodiments relate to systems and methods for the enforcement of security profiles in a multi-tenant database. A multi-tenant database can be populated with data from different users or other entities. Different users may enjoy different sets of permissions to access, modify, store, and/or otherwise manipulate sets of data within the database. After authentication, a user's associated set of permissions are retrieved. When data is requested, matching tables or other objects located in the database are identified based on the user's query. Rather than retrieving matching tables or other objects directly, a meta data security engine can check the requesting user's permissions, and apply any filters or restrictions required by those permissions to the data present in the table(s). A substitution can be made of a table-valued function, including any filtered data entries, for the table itself. Flexible and granular data security rules can thereby be applied, transparently to the user.

Abstract: Techniques for testing rule-based query transformation and generation are described. An apparatus may comprise: a context component operative to receive a search query and determine a query execution context; a rules component operative to receive the determined query execution context and the search query and to determine a set of fired rules; a transformation component operative to receive the set of fired rules, the search query, and the query execution context and determine one or more transformed queries; and a results component operative to determine a search query analysis based on the one or more transformed queries, wherein the search query analysis does not depend on performing a search using the search query. Other embodiments are described and claimed.

Abstract: Techniques for data classification include receiving, at a local computing system, a query from a remote computing system, the query comprising data associated with a commodity, the data comprising one or more attributes of the commodity; matching the one or more attributes of the commodity with one or more terms of a plurality of terms in a word matrix that includes a plurality of nodes that each include a term of the plurality of terms and a plurality of links that each connect two or more nodes and define a similarity between the two or more nodes; generating, based on the matching, a numerical vector for the business enterprise commodity; identifying one or more classification regions that each define a classification of the commodity; and preparing the classifications for display at the remote computing system.

Abstract: A method of evaluating a semantic relatedness of terms. The method comprises providing a plurality of text segments, calculating, using a processor, a plurality of weights each for another of the plurality of text segments, calculating a prevalence of a co-appearance of each of a plurality of pairs of terms in the plurality of text segments, and evaluating a semantic relatedness between members of each the pair according to a combination of a respective the prevalence and a weight of each of the plurality of text segments wherein a co-appearance of the pair occurs.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for identifying matching elements between a source model and a target model comprising receiving a source model and a target model, the source model and the target model each being stored in computer-readable memory; processing the source model and the target model to generate a plurality of similarity values, each similarity value being associated with an element of the source model and an element of the target model; generating a similarity value construct based on the plurality of similarity values and elements of the source model and the target model; and identifying matching elements between the source model and the target model based on the similarity value construct.

Abstract: A method, computer-readable storage medium, and computer system are provided. In an embodiment, a request is received from a requestor. The request specifies a search term and a plurality of weights of a plurality of criteria. A plurality of products are found that satisfy the search term. A plurality of locations where the plurality of products are located are determined. A plurality of scores of the plurality of locations are calculated based on the plurality of weights of the plurality of criteria and a plurality of ratings of the plurality of criteria at the plurality of locations. A best product of the plurality of products located at a best location with a best score of the plurality of scores is selected. In an embodiment, a supplier of the product that is not selected as the best product is notified of the score.

Abstract: Techniques for providing contextually-relevant content include identifying content items accessed through a portal by a plurality of users, each user associated with one or more roles of a plurality of roles within the portal; updating a trace log to include information associated with the identified content, the information including associations between each identified content item and the role accessing each identified content item; receiving, from a user associated with a particular role of the plurality of roles, a search query through the portal for one or more content items; determining a plurality of search results responsive to the search query, the search results relating to the content items; for the particular role, filtering the plurality of search results based on the trace log; and generating a plurality of filtered search results for presentation through the portal.

Abstract: Methods, computer-readable media, and systems for managing business objects data sources. A search query that includes multiple query terms is received. Each query term at least partially represents metadata associated with one of multiple business objects data sources that each stores multiple data items. Multiple search index documents are searched to identify one or more business objects data sources that are each associated with metadata at least partially represented by each query term. Multiple metadata tables are searched to identify metadata associated with each identified business objects data source. The identified business objects data sources are searched for data items that satisfy the identified metadata. Representations of the data items and the metadata are provided in response to receiving the search query.

Abstract: Computer-storage media, methods, and systems for improving the ability of a user to accomplish a task that is pending during a search session are provided. This pending task can be distilled by identifying a current searching intent associated with a recently submitted query and by determining which candidate tasks are most comparable to the current searching intent of a user. The candidate tasks are mined from a search history of the user by categorizing those navigation events that appear to share a semantically common concept. Upon performing a comparison, the candidate task that captures the user's true current searching intent is designated as the pending task. When a user invokes the pending task, a collection of elements that are associated with the pending task are dynamically organized into a sharable content page, thereby providing a collaborative experience that involves exposing the collection to contacts and accepting feedback therefrom.

Abstract: A marketplace system is described herein for ranking programs based, at least in part, on the assessed distinctiveness of the programs. In one implementation, the marketplace operates by: (a) accessing a set of programs; (b) extracting feature information from each of the programs; (c) generating similarity information for each program, based on the feature information; (d) ranking the programs based at least on the similarity information, to provide ranking information; and (e) providing a user interface presentation that has an effect of promoting at least one distinctive program in the set of applications on the basis of the ranking information.

Abstract: Typical frequently-asked question (FAQ) systems perform keyword searches on queries to a database of answers to deliver an answer to a user. The present invention searches a user generated query in a classifier trained to search a database of questions in a set of FAQs. The questions in the database correspond to answers. Upon finding a relevant question, the system returns the corresponding answer to the user. Searching the query against the questions generates more accurate results for the user.

Abstract: Inductive synthesis and combination framework technique embodiments are presented that generally perform string transformations involving lookup operations in one or more relational tables, either alone or in combination with other non-lookup operations. More particularly, a semantic string lookup transformation language is presented, which can be used to generate an inductive synthesis procedure that synthesizes a set of transformations involving lookup operations that are consistent with the given set of input-output examples. In addition, a combination framework for combining the lookup transformation language and its synthesis procedure, with other transformation languages and their associated synthesis procedures, is presented. The resulting combined synthesis procedures enable the combination framework to synthesize transformations on a rich variety of data-types.

Abstract: Techniques for distributing information over a network having a database in data communication with said network include a method that records in the database a plurality of computer readable profiles. Each computer readable profile corresponds to one of multiple users of the network. One of the computer readable files includes a query term that is associated with it. Generated on a common user interface are both perceivable stimuli in response to activity on said network of users corresponding to subgroup of the plurality of computer readable profiles, and information corresponding to computer readable profiles of the subgroup. The corresponding users of the subgroup possess knowledge related to the query term. A region of the user interface in which the perceivable stimuli is present defines an activity stream region. A region of the user interface in which said information is present defines a connections region of the user interface.

Abstract: A method, apparatus, and non-transitory computer readable storage medium for validating content is provided. Data is parsed into at least a first group of data and a second group of data according to a plurality of types of content present in the data. The data is ingested into an associative memory. The associative memory forms a plurality of associations among the data. The associative memory is configured to be queried based on at least one relationship selected from a group consisting of direct relationships and indirect relationships among the data. The associative memory comprises a content-addressable structure, the content-addressable structure comprising a memory organization in which the data is configured to be accessed by the content as opposed to being configured to be accessed by addresses for the data. The first group of data and the second group of data are communicated in a graphical representation.

Abstract: A social networking system includes a mechanism for integrating user actions on objects outside of the social networking system in the social graph. External system operators include widgets that, when executed by user devices, record user interactions that correspond to a defined structure of actions and objects. Information about the actions and the objects is gathered from external systems as users of the social networking system interact with the external systems. Content items are ranked according to the information about the actions and the objects as well as preferences of the viewing users.

Abstract: Methods, computer systems, and computer-readable media for accelerating a learning-to-rank algorithm using a central processing unit (CPU) and a graphics processing unit (GPU) are provided. The GPU processes document pairs created by the CPU in parallel to generate a lambda-gradient value and a weight for each document. The CPU builds a regression tree for the documents. The GPU is utilized to accelerate this process by constructing histograms of feature values, wherein the address of bins collecting the same feature value are shifted during the construction of the histogram. The output of the regression tree is a score for each document which is used to rank or order the document on a search engine results page.

Abstract: Systems, methods, and computer-readable code for processing queries for XML twigs using bottom-up processing include: receiving, by a computing device, a query XML twig including at least one sub-twig; determining whether an element in an XML tree is a root element of at least one sub-twig of the query XML twig, evaluating an arbitrary Boolean operation in the at least one sub-twig; populating a logic block if the element is a root element of the at least one sub-twig; inserting the element into an appropriate stack of a hierarchical stack if the element is not a root element of the at least one sub-twig; evaluating whether the element contributes to finding results of the query; discarding the element if the element does not contribute to finding results of the query; and determining whether the element is the root of the query XML twig.

Abstract: A tool for generating at least one search index for a composite document, wherein the composite document comprises multiple component documents. The search index is generated by extracting characters from the document, segregating the characters into tokens of one or more characters, and determining location information of the tokens. The location information can include the page number of the component document and X, Y page coordinates for the tokens. The tool also provides a user interface that allows for searching of the composite document using at least one of the generated indexes. The user interface allows the user to enter one or more search terms and to select the criteria that will be used during the search. Results are presented to the user via a list of document names that are also hyperlinks to the document. The results documents are listed in order of relevancy, and fragments of text that contain the searched terms are also available to the user, for each document.

Abstract: A model for mapping the raw text representation of a text object to a vector space is disclosed. A function is defined for computing a similarity score given two output vectors. A loss function is defined for computing an error based on the similarity scores and the labels of pairs of vectors. The parameters of the model are tuned to minimize the loss function. The label of two vectors indicates a degree of similarity of the objects. The label may be a binary number or a real-valued number. The function for computing similarity scores may be a cosine, Jaccard, or differentiable function. The loss function may compare pairs of vectors to their labels. Each element of the output vector is a linear or non-linear function of the terms of an input vector. The text objects may be different types of documents and two different models may be trained concurrently.

Abstract: In one embodiment, accessing a set of characters of a search query currently entered into a text entry box; compiling a first set of search results based on the set of characters currently entered into the text entry box, wherein the compiling is re-executed responsive to changes to the set of characters entered into the text entry box; associating an image with each search result from the first set of search results; and presenting the first set of search results as a first set of images adjacent to the text entry box.

Abstract: A system for adding security data to a search index comprises a processor and a memory. The processor is configured to select an object in a search index, wherein an entry associated with the object is stored in the search index and add security entity data to an entry of the search index corresponding to the selected object. A memory is coupled to the processor and is configured to provide the processor with instructions.

Abstract: A non-transitory, computer readable storage medium storing a program for a computer being capable of accessing a group of nodes having divided-data structures obtained by dividing a data structure having a transposed hierarchical bloom filter of a hierarchical bloom filter and sets of data blocks by a predetermined bit width, wherein the hierarchical bloom filter has h-stage bloom filter arrays each having a bit width of “s”, the hth-stage bloom filter array having bits indicating false positives or negatives and the pth-stage bloom filter array having n=d[h-(p-1)] bloom filters (where 1?p?h) each having a bit width of m=s/d[h-(p-1)] (where d indicates a division number for the hth-stage bloom filter array), the transposed hierarchical bloom filter is obtained in the bloom filters in the bloom filter array, and the set of data blocks corresponds to the first-stage bloom filter array of the hierarchical bloom filter.

Abstract: Provided is a search result providing system and method for providing a loan word pronunciation service. The search result providing system includes a storage device, an original word-allomorph maintaining unit configured to store an original word, a loan word corresponding to the original word, and a first allomorph of the original word; a related loan word searching unit configured to find a related loan word from the original word-allomorph maintaining unit in response to a query, in which the related loan word is related in pronunciation with at least one of the original word, the loan word, and the first allomorph; and a related loan word providing unit configured to expose at least one related loan word as a search result.

Abstract: Certain embodiments of the invention may include systems, methods, and apparatus for providing for utility common pool database. According to an example embodiment of the invention, a method is provided for utilizing a common pool database. The method may include transmitting, by one or more networks, one or more queries comprising location data from a mobile device to a server in communication with a database; receiving, from the database by the one or more networks, localized field information based at least in part on the one or more queries; and outputting the localized field information via the mobile device.

Abstract: One or more techniques and/or systems are disclosed for providing relevant information for a term identified in a user message. A user can read or write a message and one or more terms can be identified in the message, where an identified term may comprise one or more words or characters. One or more data structures comprising indications of temporally recognized terms can be stored locally, and the identified terms can be compared against the locally stored data, such as for fast retrieval. If the identified term matches one or more of the temporally recognized terms in the locally stored data, the user may select the temporally recognized term to perform an action assigned to the temporally recognized term. The assigned action can comprise retrieving relevant information for the term, such as finding movie times (e.g., where the term comprises a movie title).

Abstract: Techniques and tools are described for refining source-code query results. For example, source-code query results for a query can be generated, semantic clusters of the source-code query results can be generated, and based on a selection of a semantic cluster option, refined source-code query results can be sent. Also, for example, source-code query results can be received, selections of facet values associated with groups of the source-code query results can be sent, and based on selected facet values, a subset of the source-code query results can be received.

Abstract: Systems and methods for searching a document corpus and generating search queries are disclosed. A method includes providing for display a graphical user interface having two or more sections, and providing for generation of an initial search query based on locations of query terms entered into the graphical user interface. Sections of the graphical user interface indicate a query status. A revised search query based on a location of the query terms within the graphical user interface is generated following the manipulation of one or more of the query terms. Movement of a selected query term from a first section to a second section of the graphical user interface changes the query status of the selected query term from a first query status to a second query status. A search of the database is performed using the revised search query to return an updated set of electronic documents for display.

Abstract: A computer-based system and method for intelligent resume search on online repositories is disclosed. The parameters in the resumes and the attributes related to the said parameters are identified and extracted by scanning the resumes sequentially and are stored in an index file. Search queries are constructed based on accepted query parts as input. The index file is indexed to locate the parameters relevant to the search queries. An initial score is assigned to the parameters located which is transformed to new score based on identifying additional domain intelligence in the derived attributes related to the located parameters. Finally, the resumes relevant to the parameters with the transformed score are retrieved and displayed.

Abstract: One embodiment of the present invention sets forth a technique for supplementing user-specified text for a search with context information to generate search results that is more closely matched to the user's needs. A context search component maintains a snapshot of the user context and additional context-based queries are generated and corresponding searches are performed. The search results of the context-based queries are merged with the results of the user-specified text query and displayed for the user. When the user accesses a resource listed in the merged search results, the context-based terms mentioned in the resource are identified to the user.

Abstract: Methods, systems and articles of manufacture are provided for accessing data within data repositories. Public UDTFs, private UDTFs and a metadata processor are utilized to provide access to data residing in a variety of data repositories.

Abstract: A user-interface method of selecting and presenting a collection of content items based on user navigation and selection actions associated with the content is provided. The method includes associating a relevance weight on a per user basis with content items to indicate a relative measure of likelihood that the user desires the content item. The method includes receiving a user's navigation and selections actions for identifying desired content items, and in response, adjusting the associated relevance weight of the selected content item and group of content items containing the selected item. The method includes, in response to subsequent user input, selecting and presenting a subset of content items and content groups to the user ordered by the adjusted associated relevance weights assigned to the content items and content groups.

Abstract: A method, apparatus, and article of manufacture for optimizing a query in a computer system. During compilation of the query, a GROUP BY clause with one or more GROUPING SETS, ROLLUP or CUBE operations is maintained in its original form until after query rewrite. The GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations is then translated into a plurality of levels having one or more grouping sets. After compilation of the query, a grouping sets sequence is dynamically determined for the GROUP BY clause with the GROUPING SETS, ROLLUP or CUBE operations based on intermediate grouping sets, in order to optimize the grouping sets sequence. The execution of the grouping sets sequence is optimized by selecting a smallest grouping set from a previous one of the levels as an input to a grouping set on a next one of the levels. Finally, a UNION ALL operation is performed on the grouping sets.