Abstract: A categorization analysis system is provided. The categorization analysis system includes one or more hardware processors, a memory including a first plurality of listings categorized in a first target category, and a categorization analysis engine executing on the one or more hardware processors. The categorization analysis engine is configured to determine a label for each listing including performing a search on title, select a set of training listings based on the determined labels, train a first model using the set of training listings and the determined labels, the first model being a classification model configured to classify categorization of listings, identify a suspect listing categorized in the first target category, apply the suspect listing to the first model, thereby generating a categorization result for the suspect listing, the categorization result indicating miscategorization of the suspect listing, and identify the suspect listing in the memory as miscategorized.

Abstract: Provided are a method and an apparatus for searching for and acquiring information under a computing environment. The apparatus includes: at least one input device configured to receive a first query input of a first query type and a second query input of a second query type; and a controller configured to output a query input window including a first display item corresponding to the first query input and a second display item corresponding to the second query input, to automatically switch, in response to receiving the first query input, the apparatus from a first state to receive the first query input of the first query type to a second state to receive the second query input of the second query type, and to obtain a search result according to a query based on the first query input and the second query input.

Abstract: Disclosed herein are system, method, and computer program product embodiments for distributed transaction processing in massively parallel processing (MPP) databases. An embodiment operates by receiving a transaction including a read timestamp corresponding to a version of data of a database associated with the query. It is determined whether a locally stored portion of the data of the database has a local timestamp that is equivalent to or after the read timestamp. A lock may be requested, and if received, the data is updated.

Abstract: Techniques for determining search results based on session based refinements are presented herein. A method is disclosed that includes receiving a query in a user session, the query comprising one or more search parameters, detecting, in the user session and after receiving the query, a user event associated with a property of an item, updating a record in a table that associates the query with the property, the table comprising a plurality of records that associate the query with respective item properties, the record comprising the query, the property, and a score, and ranking search results for a subsequent query based on the associated properties indicated in the plurality of records, the subsequent query including the one or more search parameters.

Abstract: Embodiments of the invention provide systems and methods for implementing process metadata triggers and events. More specifically, embodiments of the present invention allow for process metadata events to be defined and generated, including the program code and interfaces that may define the triggering criteria and actions associated with the events. Certain embodiments include ongoing evaluations of triggering criteria for events, including criteria both internal and external to an enterprise system, and generating new event occurrences based on the evaluations of triggering criteria for events. Events and event occurrences may be tracked and monitored, and programmatic actions may be initiated in response to the creation or modification of an event or an event occurrence, including modification of enterprise system software, generation and transmission of targeted user notifications, the generation and customization of electronic documents, and the like.

Abstract: Implementations generally relate to sharing photos. In some implementations, a method includes collecting photos associated with one or more objects, where the photos are collected from a plurality of users. The method also includes collecting attention information associated with the one or more objects. The method also includes generating an attention map based on the attention information. The method also includes grouping the one or more photos into groups of photos based on the attention map. The method also includes causing the groups of photos to be displayed to a target user based on one or more predetermined criteria.

Abstract: A system includes receiving a substring to be searched and determining one or more N-grams associated with the received substring. A lookup of each of the one or more N-grams is performed using an N-gram index. A set of tokens associated with each of the one or more N-grams is calculated and a determination is made if the substring exits in the calculated set of tokens. The results of the determination if the substring exits in the set of tokens are outputted.

Abstract: Techniques are provided for moving data between partitions. Such a process may be performed without requiring any locks that block transactions that target a partition from being executed. Instead, such transactions may proceed while a move operation is being performed. The move operation involves copying data from the targeted partition to another partition that is hidden from (or “invisible” to) those transactions that attempt to read from or write to the partition. During the move operation, changes that are made to the partition are also reflected in a journal. Eventually, the changes reflected in the journal are drained and applied to the hidden partition. Once the partition and the hidden partition are synchronized, the identities of the partitions are swapped so that future transactions will target the previously-hidden partition instead of the previously-viewable partition.

Abstract: A tracking system passively tracks and records searches conducted by actual search engine users. The recorded data for each search event preferably includes the search query submitted, the search engine used, the search result item (e.g., web page) selected, the position (e.g., page number) of this item, and the user's IP address. The collected data is aggregated and analyzed to generate data regarding the search queries used to locate and access particular destinations (e.g., web pages and sites). This data may be used for various purposes, such as (1) to generate reports showing, e.g., how users reach a particular destination from different search engines and geographic locations, (2) to select content to display on a destination page, such that the content is relevant to search queries commonly used to locate that page, and (3) to update the database of one search engine to reflect searches conducted on other search engines.

Abstract: In one embodiment, a search query is received from a computing device, the search query including one or more search terms. Based on the one or more search terms, one or more entities are identified from a set of multiple entities. Each of the one or more identified entities is associated with one or more application functionalities. In addition, a set of applications are identified based on the one or more search terms. Based at least on a type of at least one of the identified one or more entities, a determination is made that a particular application from the set of applications supports the at least one of the identified one or more entities. Thereafter, the applications in the set are ranked based in part on the determination that the particular application supports the at least one of the identified one or more entities.

Abstract: A solution for maintaining the operation of a server and allowing the transfer of data from client devices to a database without locking the database during an audit and pack process is realized that reduces the amount of time lost due to backup file storage transfer. When a file is backed up to a first storage trail through the audit process, the trail may eventually become filled to capacity. Upon the first storage trail filling to capacity, a pack process is initiated, and a backup storage trail is created to store the data during this process. Upon completion of the pack process, the data from the backup storage trail is transferred to another active storage trail.

Abstract: Embodiments of a method for creating a methodology implementation that supplements a business application are described. In one embodiment, a comprehensive customer engagement methodology is maintained on a server and defines processes and disciplines related to the business application. A series of requests is received from a collaborative computing environment. The series of requests collectively represent a request for a collection of documents and related metadata included in the comprehensive customer engagement methodology. The series of requests are then responded to by providing a copy of the collection of documents and related metadata.

Abstract: A third party website provides a search interface to a general search engine. A site profile of the third party website describes various topics, keywords, or domains that are potentially relevant or of interest to users who access the third party website. The topics are associated with a topical directory, with domains associated with each topic; the domains in a given topic are given various weightings. When a search is submitted to the general search engine from the third party website via the search interface, the general search engine uses the site profile to customize the search results. The search results are customized by weighting the ranking of documents from websites associated with the topics in the site profile. The site profile can be manually or automatically constructed.

Abstract: A method includes transmitting a search query from a computing device to a search system configured to generate search results in response to a received search query, and receiving search results from the search system in response to transmitting the search query. The search results include an application access mechanism that references a native application and indicates one or more operations for the application to perform. The application performing the operations sets the application into an application state. The search results also include an application download address that indicates a location for downloading the application. The method also includes generating a user selectable link that includes the application access mechanism and the application download address, and displaying the user link. In response to receiving a user selection of the selectable link, the method also includes downloading, installing, launching, and causing the native application to perform the one or more operations.

Abstract: It is determined that a backup of a set of backup sources is triggered at a first instance by a backup policy associated with the set of backup sources. It is determined for each backup source of the set of backup sources, a size of data to be backed up. In the event the determined size of a selected backup source of the set exceeds a threshold size, a backup of the selected backup source is paused despite the backup policy specifying the backup to be performed at the first instance and the backup of the selected backup source is resumed at a second instance specified by a backup resume policy.

Abstract: Pinnacle concepts are not amenable to detection by the use of keywords. A unit of natural language discourse (UNLD) “refers” to a pinnacle concept “C” when that UNLD uses linguistic expressions in such a way that “C” is regarded as expressed, used or invoked by an ordinary reader of “L.” A reference can have a “reference level” value that is proportional to: the “strength” with which the pinnacle concept is referenced, the probability that a pinnacle concept is referenced or both strength and probability. Pinnacle concepts can be divided into Quantifiers and non-Quantifiers. A Quantifier can modify the reference level assigned to a non-Quantifier. A concept “C,” that is determined to be referenced by a UNLD “x,” after application of its Quantifiers, is said to be asserted by “x.” Concept-based classification is the identification of whether a pinnacle concept “C” is asserted by a UNLD. Concept-based classification can be used for concept-based search.

Abstract: Systems and methods for scheduling a recovery operation for a host. A user interface is displayed and a recovery operation is configured. Configuration information for the recovery operation is stored and associated with a schedule that is also set via the user interface. The recovery operation may be an ad hoc recovery operation, a periodic recovery operation, and/or a validating recovery operation.

Abstract: Methods and apparatus to identify at least a first portion and a second portion of resources to restore to a device are described. The first portion of the resources may be restored atomically to the device before the second portion of the resources. The device may not respond to at least one user input during the restoration of the first portion of the resources. If the restoring of the first portion is successful, the second portion of the resources may be restored. The device may respond to the user input during the restoring of the second portion of the resources.

Abstract: The subject disclosure relates to systems and methods for creating and managing a descriptor repository. In certain aspects, a method of the subject technology includes steps for receiving a descriptor label for a merchant, receiving a plurality of descriptor definitions for the descriptor label, and storing the plurality of descriptor definitions in a database. In certain aspects, a method of the subject technology can further include steps for receiving relevance indications for one or more of the descriptor definitions, and associating one or more of the descriptor definitions with the descriptor label based on the one or more relevance indications.

Abstract: Systems and methods are provided for adding new nodes to a computer networked system. The systems and methods may identify a first set of nodes in a networked computer system. The first set of nodes may be included in a first hash computation that clusters the first set of nodes into communities. An application shard space including a first space and a second space may be generated. The first set of nodes may be mapped to application shards in the first space based on the first hash computation. The application shards in the first space may be assigned to a first set of machines of the networked computer system. The second space may be maintained for mappings of nodes not included in the first hash computation to application shards in the second space.