摘要:
There is provided an information processing device including a storage section, a candidate acquiring section configured to acquire candidates of a related term corresponding to an input term, and a related term determining section configured to determine the related term from the candidates of the related term on basis of information stored in the storage section.
摘要:
A stopword detection component detects stopwords (also stop-phrases) in search queries input to keyword-based information retrieval systems. Potential stopwords are initially identified by comparing the terms in the search query to a list of known stopwords. Context data is then retrieved based on the search query and the identified stopwords. In one implementation, the context data includes documents retrieved from a document index. In another implementation, the context data includes categories relevant to the search query. Sets of retrieved context data are compared to one another to determine if they are substantially similar. If the sets of context data are substantially similar, this fact may be used to infer that the removal of the potential stopword(s) is not material to the search. If the sets of context data are not substantially similar, the potential stopword can be considered material to the search and should not be removed from the query.
摘要:
Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.
摘要:
Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.
摘要:
According to certain aspects, a computer system may be configured to obtain information indicating a plurality of groupings of data of a data source, the information indicating a number of data items included in each of the plurality of groupings; determine a first grouping of the plurality of groupings including one or more data items that have changed by comparing a first number of data items included in the first grouping and a historical number of data items included in each of the plurality of groupings; access data items included in the first grouping from the data source; compare the data items included in the first grouping to data items of a corresponding compressed local version of the first grouping of data items; extract changed data items of the first grouping; and forward the extracted changed data items to a destination system.
摘要:
A method and apparatus, including a computer program product, implementing techniques for displaying a table of data including a set of markers associated with rows or columns of the table, the table having one or more sort keys having a sort key order including a most significant sort key, each sort key being a row or column of the table; receiving a user input gesture selecting a marker; establishing the row or column associated with the user-selected marker as the most significant sort key, and maintaining the positions of the remaining sort keys in the sort key order; sorting the data using the sort key order; and displaying the sorted data. The techniques also include representing visually a sort key order for a table of data by displaying on a graphical user interface display one or more markers with a pattern of distinct visual properties.
摘要:
A social networking system displays raw stories about a user's friends' actions in a news ticker as those actions occur. The social networking system is monitored for actions associated with users connected with the target user. The social networking system may be continually monitored such that actions are identified in real-time as they are performed. The news ticker is updated such that stories including the identified actions and the associated connected users are displayed within a news ticker interface. The news ticker interface may be a dedicated portion of the social networking system interface, for example in a column next to a newsfeed. The news ticker interface may be updated in real time as actions associated with connected users are performed. The target user may select a displayed story in the news ticker, and additional information related to the selected story may be displayed, for instance in a separate interface.
摘要:
A feed management system is provided that includes a first application module receiving from a user a plurality of fields for processing. The first application module reads meta data from one or more database servers so as to form configuration data for extracting information from the one or more database servers. A generic feed program receives the configuration data and invokes a plurality of extractions of feed data from the one or more database servers. The generic feed program generates one or more feed files associated with the extractions of feed data.
摘要:
Secure private database querying on a database for a query having a formula evaluation on at least two keywords A and B comprises: a server receiving a Bloom filter tree comprised of encrypted Bloom filters of encrypted keywords from the database, wherein each Bloom filter in the Bloom filter tree is separately masked by a random mask pad P; receiving an encrypted version of the keywords A and B from the client; and obtaining masked Bloom filter indices for the keywords A and B. The client and server participate in secure function evaluation (SFE) with the client. The server has an input comprising the masked Bloom filter indices for the keywords A and B and the client has an input comprising the random mask pad P. The secure function evaluation comprises: removing the random mask pad P from the masked Bloom filter indices input by the server; determining if there is a matching Bloom filter for each of the keywords A and B; and applying the formula evaluation to determine if the formula is satisfied.