Abstract: The disclosure discloses a transaction processing method, a processing node, and a central node. The method includes: receiving, by the processing node in the cluster, global snapshot information according to a preset time interval, where the global snapshot information includes a transaction identifier of a running transaction in a cluster; storing the received global snapshot information in a cache; and processing the transaction according to the global snapshot information stored in the cache. In the transaction processing method, a central node in a cluster sends latest global snapshot information to each processing node according to a preset time interval, so that the processing node can store the global snapshot information. When applying for global snapshot information during transaction processing, the processing node does not need to obtain latest snapshot information from the central node. Therefore, network overheads can be reduced, and transaction processing efficiency can be improved.

Abstract: A computer-implemented system and method for analyzing clusters of coded documents is provided. Clusters of documents are displayed and at least a portion of the documents are each associated with a classification code. A representation of each document is provided based on the associated classification code or an absence of the associated classification code. A search query with search terms is received. Each search term is associated with one of the classification codes. Those documents that satisfy the search query are identified and the representations of the identified documents are changed based on the classification codes associated with the search terms. The change in representation provides an indication of agreement between the classification code of such document and the classification codes of the search terms, or an indication of disagreement between the classification code of the document and the classification codes of the search terms.

Abstract: The disclosure provides an audio/video (A/V) searching method, an apparatus and a terminal, the method includes: receiving A/V querying statement; determine keyword from the A/V querying statement; obtaining at least one instance having association with the keyword; and constructing search result knowledge graph according to the keyword, instance and association between the keyword and the instance. The search result knowledge graph constructed according to embodiments of the disclosure presents, in the form of a diagram, the keyword of the A/V querying statement, the instance associated with the keyword, and the association between the keyword and the instance. The search result knowledge graph includes not only A/V search results corresponding to the A/V querying statement, but also the association between these results. Search results presented in this form are intuitive, concise, informative, and easy to use for the user, significantly enhancing user experience.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, it is determined whether to perform a database operation using one or more vectorized instructions or without using any vectorized instructions. This determination may comprise estimating a first cost of performing the database operation using one or more vectorized instructions and estimating a second cost of performing the database operation without using any vectorized instructions. Multiple factors that may be used to determine which approach to follow, such as the number of data elements that may fit into a SIMD register, a number of vectorized instructions in the vectorized approach, a number of data movement instructions that involve moving data from a SIMD register to a non-SIMD register and/or vice versa, a size of a cache, and a projected size of a hash table.

Abstract: Embodiments of systems, program products, and methods to manage content and distribution of media are provided. An embodiment of a system, for example, can include a communication network for transmitting media files, a content management server having a processor and memory coupled to the processor, a database accessible to the processor of the content management server and including media files associated with metadata records, a plurality of content management developer computers to provide content management developers with online access over the communication network to the media files and associated metadata records to thereby edit the metadata records, a plurality of user computers accessible to the communication network to provide the users with access to the media files over the communication network to thereby view and edit at least portions of respective metadata records.

Abstract: Under one aspect, a computer-implemented method of displaying information about a media object, the media object being associated with location-related content corresponding to a location, includes receiving a request to display a representation of the media object; in response to the request, obtaining a summary of the media object; in response to the request, obtaining a spatial thumbnail of the media object, the spatial thumbnail comprising an image of a spatial domain encompassing the location; and simultaneously displaying both the summary of the media object and the spatial thumbnail on a visual display.

Abstract: Methods and apparatus consistent with the invention allow a user to submit an ambiguous search query and to receive relevant search results. Queries can be expressed using character sets and/or languages that are different from the character set and/or language of at least some of the data that is to be searched. A translation between these character sets and/or languages can be performed by examining the use of terms in aligned text. Probabilities can be associated with each possible translation. Refinements can be made to these probabilities by examining user interactions with the search results.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for assisting with task continuation and completion are provided. First data from a device received from a first context may be received. The first data may be ranked in a clustered intent index, the clustered index comprising a plurality of categorical hierarchies related to the first data. Second data from the device may be received from a second context, the second data providing an indication to assist with task continuation. The relevance of the second data to the clustered first data may be determined, the determining comprising evaluating extracted information from the second data with a threshold related to at least one of the plurality of categorical hierarchies. Content related to the first data may then be sent to the device.

Abstract: A mobile device receives ranked news feed stories from a server of a social networking system. The mobile device determines whether to adjust the ranking based on local information generated by applications executing on the mobile device or hardware of the mobile device. Examples of local information of the mobile device include information describing the mobile devices' network connection, geographical location, sensor readings, downloaded data on memory storage, and interactions of software applications executing on the mobile device. For example, if a network co-processor of a mobile device detects a slow network connection, the mobile device lowers the ranking of news feed stories expected to require further use of network bandwidth.

Abstract: Sentiment scores for a first set of text can be normalized based on a statistical measure of sentiment of a corpus of text authored by a set of authors having respective personality profiles similar to a personality profile of an author of the first set of text. The set of authors can be grouped in a first cluster based on a range of at least one metric of a personality profile. A plurality of respective sentiment scores for portions of the corpus can be generated for the first cluster. A statistical measure of the plurality of respective sentiment scores can be generated. The plurality of respective sentiment scores can be normalized based on the statistical measure. The plurality of respective normalized sentiment scores can be applied to the first set of text to generate one or more sentiment scores for the first set of text.

Abstract: Mechanisms are provided for implementing a candidate answer variant engine. The mechanisms receive an indication of a structured portion of content in a corpus, generate a plurality of groupings of elements of the structured portion of content, and generate, for each grouping of elements in the plurality of groupings of elements, and for each element in the grouping of elements, a corresponding grouping vector representation, corresponding to the element. The mechanisms, for each grouping vector representation of each grouping of elements in the plurality of groupings of elements perform a similarity measure calculation between the grouping vector representation and a vector representation of an input question, and select an element corresponding to the grouping vector representation for inclusion as a candidate answer variant based on results of the similarity measure calculation. The mechanisms perform question answering operations based on an analysis of one or more candidate answer variants.

Abstract: In one embodiment, a method includes accessing a number of content objects associated with a user; and analyzing text, audio, or visual content of each of the content objects as well as any interactions by the user with each of the content objects. The analyzing includes identifying subject matter and user sentiment related to the respective content object. The method also includes inferring, based on the identified subject matter or user sentiment, one or more interests of the user; and modifying, for display on a client device, an online page of the user to incorporate content related to one or more of the inferred interests of the user.

Abstract: An on-line social network system is configured to generate a news feed for a member by processing updates originating from different sources using different first pass ranker models. The first pass ranker models generate respective sets of raw scores, which are calibrated based on a consistent scale of feed engagement metrics of interest, such as a click through rate. The calibrated scores are then used as training data to train a second pass ranker and/or as input into the second pass ranker at the time when the second pass ranker is to generate respective ranks for items in an inventory of updates identified as potentially of interest to a focus member and to select a subset of items from the inventory based on the generated respective ranks.

Abstract: In one embodiment, a method includes receiving an input corresponding to a search query from an online page of a social-networking system. The online page corresponds to a target user of the social-networking system. The method also includes identifying one or more of a number of content objects associated with the target user. The association is based at least in part on analyzing text, audio, or visual content of each of the plurality of content objects as well as interactions by the target user with each of the plurality of content objects. The method also includes scoring each of the identified content objects based at least in part on an affinity score of the content object relative to a querying user; and ranking each of the identified content objects based at least in part on the affinity score.

Abstract: Each node in a subset of graph nodes has an associated label value indicating a characteristic of the corresponding item. Matrix data and graph label data are stored. The matrix data defines a matrix representing the graph. The graph label data defines a graph label vector indicating label values associated with nodes of the graph. For at least one set of nodes, test label data is generated defining a test label vector. A propagation function is defined, comprising a set of basis functions, having respective coefficients. The coefficients are calculated which minimize a difference function dependent on difference between the graph label vector and a result of applying the propagation function to the test label vector for said at least one set. New label values are calculated for nodes in K by applying the propagation function with the calculated coefficients to the graph label vector, thereby propagating labels.

Abstract: Various embodiments of the present disclosure include systems and methods for analyzing patents and prior art in a patent management system. In an example embodiment, a computer-implemented method of determining a potential point of novelty for an identified patent comprises retrieving at least one independent claim of the patent in the claim form as issued; retrieving at least one independent claim of the patent in the claim form as published; and automatically comparing the issued claim to the published claim by identifying unique keywords present in the issued claim but not present in the published claim and flagging the unique keywords to a user.

Abstract: Techniques are disclosed relating to insertion of objects into a database. In some embodiments, a client may programmatically define arbitrary relationships (such as hierarchical relationships) among different types of objects to be inserted into a database at a server. The objects may then be sent to the database, which may determine an insertion order that allows the desired relationships to be created. The insertion may then be committed, causing all the desired objects and relationships to be created in the database.

Abstract: A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator. A corresponding computer program product and computer system are also disclosed.

Abstract: A method in a computer system includes displaying a user interface screen to aid in generating search queries for a semantic database. The user may select two or more data classes from a displayed class hierarchy. Analysis of the semantic database may lead to generating and displaying one or more paths via class relationships between selected data classes. The user may interact with a displayed path of class relationships to provide input to the system, and from that input the system may automatically generate a search query.

Abstract: An interactive user interface for displaying projects comprising a collection of links specifying data to be displayed from a plurality of different applications and/or data sources. When loading a project for display, links are automatically parsed to identify the application and/or data source they are associated with. Retrieved data associated with the links is displayed in a format based upon that of their native application. The data may be displayed in an interactive format, allowing the user to change or manipulate the data in a manner that would be possible in the data's native application. A project may be expressed as a “project link,” comprising a text string, wherein the links of the assets associated with the project are included or embedded within the text string, and which may be shared between different users, and may function as a snapshot of the project.

Abstract: Method, system, and programs for providing enhanced query term suggestions. Candidate query terms may be obtained based on a prefix of incomplete query terms received. The candidate query terms may be ranked, at least partially based on, their similarities with respect to query terms previously entered in the same search session as the incomplete query term. In some implementations, for determining such similarities, feature vectors and/or signatures may be stored in association with query terms. Similarity between a candidate query term and query terms in the same search session as the incomplete query term may be determined using the feature vectors and/or signatures associated therewith.

Abstract: Systems and methods are provided for generating classification data which is used for classifying documents. The method includes reading documents in a form of a spreadsheet; collecting cell values in each of the documents; finding one or more common cell values among the collected values; counting, for each of the common cell values, a number of the documents having the common cell value; storing, if the number of the documents is equal to or larger than a predetermined number, the common cell value as a candidate header label in a memory; calculating a distance between cell locations of the candidate header labels in each of the documents; choosing, according to the calculated distance, two or more candidate header labels among the candidate header labels for each of the documents; and storing one or more combinations of the chosen two or more candidate header labels as the classification data.

Abstract: Various methods and systems of statistical data processing and natural-language-processing are disclosed. According to one embodiment, an intelligent, automated KPI-discovery method uses existing machine-learning algorithms and Natural Language Processing (NLP) for extraction and construction of KPIs.

Abstract: A notification based on a destination of a file operation is provided. A file management service initiates operations to provide the move notification upon detecting the move operation to move the file from a source location to a destination location. A stakeholder is identified with an access to the destination location prior to executing the move operation to move the file from the source location to the destination location. After executing the move operation, a move notification is generated to inform the stakeholder of the move operation. The move notification provides information such as a description of the file, the source location, the destination location, and/or an identification of an initiator of the move operation. Furthermore, the move notification is transmitted to the stakeholder.

Abstract: The present invention discloses a search method and apparatus, wherein the method comprises: receiving, at a browser side, a search keyword inputted to an input box component; obtaining a search result corresponding to the search keyword, the search result comprising feature information carrying a feature identifier; and displaying the search result, wherein the feature information carrying a feature identifier is ranked first in the search result. The present invention may obtain accurate key information from the feature information carrying a feature identifier, and avoid a situation where bandwidth resources are consumed because of repeatedly searching for correct feature information due to the feature information being erroneous. Thus user operations are simplified and search efficiency is improved.

Abstract: Example embodiments of the present disclosure include a system comprising a computer-readable storage medium storing at least one program and a computer-implemented method for providing an endless search result page. In example embodiments, search results from a current level of a search are presented on the search result page displayed on a client device. A scroll indication applied to the presentation of the search results from the current level is detected. Based on a direction of the scroll indication, the search results from the current level are scrolled on the search result page. A determination that an end of the presentation of the search results from the current level is reached in response to the scrolling is made. In response, search results from a previous level are appended to the end of the presentation of the search results of the current level to cause continuous presentation of the search result page.

Abstract: A mobile web page shows a hashtag and messages with that tag. The page shows one or more deep links or linkets, related to the topic of the messages. If a user clicks a deep link or linket, an app is launched on the mobile device, to connect to an app on a different device. The user interacts with a second user. The latter can be an instructor or teacher or observer of the topic. The first user can be a student. Extra interactive possibilities for mobile visitors to the website. The app can be more engaging than using a browser. The website charges for the linket ad. Similar steps are done for a page with an author's username, where the page shows messages by the author and the messages have hashtags. This page has a linket ad. If the ad is by the author, this lets the author promote herself or an item sold by her or an event (like a concert) where she will be playing. More incentive for her to write more hashtag messages, to garner a greater audience.

Abstract: Social networking activity information pertaining to a set of social networking activities performed by a plurality of contacts on a social networking site is obtained from the social networking site. A recommended time for the user to publish content on the social networking site is determined. The content is sent to the social networking site to be published at the recommended time.

Abstract: Techniques and mechanisms described herein facilitate the execution of a software program container having a plurality of layers. Each layer may include a plurality of files. For instance, a base layer may include a version of an operating system, while an upper layer may include a software program configured to run within the operating system. Different layers may store, create, or modify the same file. However, the precedence of the version of the data for the file may be based on an ordering of the layers. For example, the version of the file in a higher layer should supersede the version of the file in a lower layer. In some implementations, a privileged storage container that runs atop a virtualization layer may manage storage resources for other containers. The privileged storage container may store each file in a software program container as a snapshotable object.

Abstract: Approaches presented herein enable automatically removing a potential tag of a subject depicted in a multimedia item based on a context of the multimedia item and one or more preferences of the subject being tagged. Specifically, a request to tag a subject in the multimedia item is received, and the multimedia item is analyzed to determine a context. The context is compared to the preferences related to the subject to determine a variance. If a variance exists, a removal action related to the tag is performed, such as disallowing or removing the potential tag.

Abstract: A data deduplication method includes detecting a deduplication transaction including a data pattern associated with a data pattern address (DPA) and a reference, to the pattern, associated with a data reference address (DRA). A deduplication key may be determined based on the DPA and the DRA by concatenating the DPA and the DRA with the DPA as the most significant bits. The key may be stored in a key field of a record in a persistent and sequentially-accessed log, which is part of a log-with-index (LWI) structure that also maintains, in RAM or SSD, a binary index of the log records. When full, the log is cleared by writing the records in key-sorted order to the new tablet. From time to time, two tablets in the tablet library are merged. Tablet merging may include two or more atomic merges, each atomic merge corresponding to a portion of the tablet.

Abstract: Techniques for selecting a storage node of a storage system to store data include applying a first function to at least some data chunks of an extent to provide respective first values for each of the at least some data chunks. A storage node, included within multiple storage nodes of a storage system, is selected to store the extent based on a majority vote derived from the respective first values.

Abstract: A file access event relating to a file may be detected. A local file value rule may be applied to modify a local value of the file in response to the file access event. A local file replication rule may be applied using the modified local value to determine whether to replicate the file.

Abstract: Each file storage apparatus of a plurality of file storage apparatuses stores a file system, and associates and stores paths of elements in the file system and archive destinations of the elements in an archive storage apparatus. When the file system is operated, each file storage apparatus transmits archive data of an element as an operation target, and operation information including operation details to the archive storage apparatus. The archive storage apparatus receives the archive data and the operation information, stores the archive data, and stores consistency information including the operation information and archive versions indicating a reception order of the operation information.

Abstract: Embodiments described herein provide techniques for maintaining consistency in a distributed system (e.g., a distributed secondary storage system). According to one embodiment of the present disclosure, a first set of file system objects included in performing the requested file system operation is identified in response to a request to perform a file system operation. An update intent corresponding to the requested file system operation is inserted into an inode associated with each identified file system object. Each file system object corresponding to the inode is modified as specified by the update intent in that inode. After modifying the file system object corresponding to the inode, the update intent is removed from that inode.

Abstract: An example method of live migration of distributed databases may include implementing a first intermediate database access mode with respect to a distributed database to be migrated from an original set of storage servers to a destination set of storage servers, wherein, in the first database access mode, database read requests are routed to the original set of storage servers and database update requests are routed to both the original set of storage servers and the destination set of storage servers. The method may further include copying a plurality of records of the distributed database from the original set of storage servers to the destination set of storage servers. The method may further include switching to a second intermediate database access mode, in which database read requests are routed to the destination set of storage servers and database update requests are routed to both the original set of storage servers and the destination set of storage servers.

Abstract: A method includes detecting content items stored locally on a client device, each content item including a time stamp and geospatial metadata; identifying one or more sets of content items based on their time stamps being within a first predetermined time range; determining, for each set of content items, a geographic location associated with the content items of the set based on the geospatial metadata of each content item; generating a list of all geographic locations associated with the sets of content items; selecting subsets of content items based on determining that the time stamps associated with each content item of the subset are within a second predetermined time range; determining, from the selected subsets of content items, non-overlapping subsets of content items based on a parent geographic location associated with the selected subset; and sending instructions to categorize content items into the non-overlapping subsets of content items.

Abstract: A system is described that a geospatial coordinate component arranged to identify a set of geospatial coordinates from a geospatial dataset. A temporal coordinate component is arranged to identify a set of temporal coordinates from a temporal dataset. The system includes an article query component that is arranged to determine a set of articles based on the set of geospatial coordinates and the set of temporal coordinates. A presentation component is arranged to present a representation of a member of the set of articles. The geospatial coordinate component can receive a user selected geographical area and intersect the geospatial dataset with the geographical area.

Abstract: Techniques for formulating queries and retrieving relevant results for 3D components in a virtual or augmented reality system. In an aspect, a user works with a 3D component using a workflow, and views the 3D component from one or more selected perspective views. Data associated with the workflow and the selected perspective views are transmitted to an online engine. The online engine may include a query formulation module for automatically forming a query based on the received workflow data and selected perspective views. The formulated query may be supplied to a search engine to retrieve online results based on relevance to the formulated queries. One or more most relevant online results may be seamlessly served to the user as part of the workflow.

Abstract: According to one embodiment, a first set of one or more images are identified as a list of image candidates to be matched with a content item that is identified in response to a search query, where the content item is provided by a first content provider. A first lookup operation is performed in an image whitelist table to identify a second set of one or more images that are associated with a second content provider other than the first content provider. Any image candidate that is included in the second set of the images is removed from the list of image candidates. One of the candidate images is then selected to be associated with the content item.

Abstract: An image retrieval apparatus capable of retrieving a desired image from images shot continuously in a short time. A display control unit displays the images on a display unit in order in a first or second transition direction according to a user's operation. A setting unit sets up a limit point in the first (second) transition direction when the direction in which the images are displayed in order is switched from the first (second) transition direction to the second (first) transition direction based on an image displayed at a time of switching. The display control unit stops displaying the images in order in the first (second) transition direction when a displayed image reaches an image corresponding to the limit point in the first (second) transition direction during the images are displayed in order in the first (second) transition direction.

Abstract: The invention relates to a computer-implemented method for automatically extracting data from a scatter plot. The method comprises receiving a digital image of a scatter plot; analyzing the received digital image for identifying a plurality of pixel sets, each pixel set being a group of adjacent pixels; analyzing the pixel sets in the received image or in a derivative of the received image for generating a plurality of templates; comparing the templates with pixels of a target image for identifying matching templates; identifying data points for the identified similar templates; assigning to each identified data point a data series; and returning the identified data points.

Abstract: According to one embodiment, images are identified to be matched with a content item that is identified in response to a search query. For each of the images, a matching type score is calculated based on a first set of one or more keywords associated with the search query and a second set of one or more keywords associated with the image. A matching quality score is calculated for the image based on the matching type score, the first set of keywords, and the second set of keywords. The images are ranked based on their respective matching quality scores. One of the images with a matching quality score higher than a predetermined threshold is selected, where the selected image is to be associated with the content item.

Abstract: According to one embodiment, a request is received for evaluating matching between a content item and an image that were identified and selected from a plurality of content items and images in response to a search query. First metadata associated with the content item, second metadata associated with the image, and third metadata associated with the search query are obtained. A first similarity score is determined based on the first metadata associated with the content item and the third metadata associated with the search query. A second similarity score is determined based on the second metadata associated with the image and the third metadata associated with the search query. An evaluation score is calculated for matching of the content item and the image in view of the search query. The evaluation score is utilized to identify subsequent content items and images in response to a subsequent search query.

Abstract: Provided in the present disclosure are a computer-implemented searching method and a server. The computer-implemented searching method includes: receiving, at one or more computing devices, a current searching term sent by a client; obtaining, at the one or more computing devices, a picture-expressible term contained in the current searching term; obtaining, at the one or more computing devices, a picture result according to the picture-expressible term; and sending, at the one or more computing devices, the picture result to the client. The present method improves the effect of the information expression of the search results.

Abstract: Provided is a method and system for performing a map image search based on the context of an image. A map image search method may include receiving a query for a map image search; searching for a map image corresponding to the query using context that is acquired as an image analysis result of the map image; and providing a service or content using the map image corresponding to the query.

Abstract: The present invention provides a method (100,200) for identifying, retrieving and/or processing one or more images (12n) from one or more source network locations (14n) for display at one or more predetermined target network locations (16n). The method includes the steps of: acquiring an address (36n) for each of the one or more source network locations (14n); perusing data available at each of the one or more source network locations (14n) to identify one or more images (12n) suitable for display at the one or more target network locations (16n); retrieving any images (12n) identified as being suitable for display at the one or more target network locations (16n); processing the retrieved images (12n), as required or desired, in order to adapt the images (12n) for display at the one or more target network locations (16n); and, selectively displaying the retrieved and/or processed image or images (12n) at the one or more target network locations (16n).

Abstract: A non-transitory computer readable medium stores a program causing a computer to execute a managing process. The managing process includes determining a location of a photo-shooting target based on photo-shooting information of image information, the image information being generated by capturing the photo-shooting target, and associating at least one shop with the captured image, with reference to location information of plural shops that has been registered in advance.

Abstract: A method is provided for obtaining and using a measure of data importance. The method include measuring a data production resource metric for a data set. The method further includes storing the data production resource metric in association with the data set, assigning an importance identifier to the data set as a function of the data production resource metric, and managing system handling of the data set according to the importance identifier assigned to the data set. For example, system handling of the data set may include processing the data set with an application selected from de-duplication, backup, redundancy routines, and tiering.

Abstract: A method of pre-allocating resources for database provisioning in a private cloud may include determining characteristics of a plurality of databases in a customer's database system. The method may also include grouping the characteristics of the plurality of databases to generate a plurality of database templates that are descriptive of the plurality of databases. The method may additionally include causing resources to be pre-allocated in the private cloud based on at least some of the plurality of database templates. The method may further include receiving a selection of a database template from the plurality of database templates as part of a provisioning request. The method may also include causing a database described at least in part by the database template to be provisioned in the private cloud.