Abstract: Systems, methods, and non-transitory computer-readable media can determine one or more respective topics of interest for at least some users of a social networking system. At least some of the topics can be propagated to at least a first user, wherein the propagated topics were determined to be of interest to users that follow the first user in the social networking system. At least one topic from the propagated topics for which the first user is a topical authority is determined.

Abstract: In one embodiment, a method includes accessing a plurality of communications, each communication being associated with a particular content item and including a text of the communication; calculating, for each of the communications, sentiment-scores corresponding to sentiments, wherein each sentiment-score is based on a degree to which n-grams of the text of the communication match sentiment-words associated with the sentiments; determining, for each of the communications, an overall sentiment for the communication based on the calculated sentiment-scores for the communication; calculating sentiment levels for the particular content item corresponding sentiments, each sentiment level being based on a total number of communications determined to have the overall sentiment of the sentiment level; and generating a sentiments-module including sentiment-representations corresponding to overall sentiments having sentiment levels greater than a threshold sentiment level.

Abstract: In one embodiment, a method includes accessing a plurality of communications, each communication being associated with a particular content item and including a text of the communication; extracting, for each of the communications, n-grams from the text of the communication; identifying mention-terms from the extracted n-grams, each mention-term being a noun-phrase; calculating a term-score for each mention-term based on a frequency of occurrence of the mention-term in the communications; and generating a mentions-module including mentions, each mention including a mention-term having a term-score greater than a threshold term-score and text from communications comprising the mention-term.

Abstract: A digital magazine server receives user comments on content items of a digital magazine and generates comment threads. A comment thread has one or more user comments associated with a content item and at least one topic. A topic thread on a selected topic includes one or more comment threads related to the selected topic. To select comment threads for a topic thread based on the selected topic, the digital magazine server determines the relevance of the topic of each comment thread to the topic of the topic thread and determines the quality of the comment thread based on a plurality of quality factors such as number of comments and timestamps of the comments in a comment thread. The digital magazine server aggregates the comment threads based on at least one of topic relevance determination and thread quality determination and selects comment threads based on the aggregation.

Abstract: To improve efficiency of computing devices and improve the user experience thereon when searching for content items, the systems and methods disclosed herein provide content item and source detection. Non-textual input is converted to a searchable format and corresponding content items are searched for based on the searchable format.

Abstract: Content object tags at a content hosting service are used to classify stored content objects. Tags and clusters of tags (groups of one or more associated tags) can be recommended to a user of the content hosting service based on a user context, such as the browsing, viewing, uploading, or searching of content objects. Tags are scored based on content objects tagged with the tags in a targeted subset of content objects and a baseline subset of content objects, and based on the relevance of the content objects tagged with the tags. These tag scores can be weighted, and one or more tags can be selected for recommendation based on the weighted tag scores. Tag clusters can be selected for recommendation using a cluster hierarchy and determining whether a targeted subset of tags occur within a maximum number of tag clusters at a particular hierarchy level.

Abstract: Recommendations for media assets are presented in the form of spaces (400). The spaces are selected in accordance with recommendations that are generated in accordance with a user profile. The spaces are then configured into an arrangement which a user can navigate through using virtual reality technology.

Abstract: Embodiments of the invention relate to identification of material that contains linguistically related content. Key phrases are filtered through a content store to ascertain the linguistically related content and to move the identified content to a target corpus. At least two iterations of the filtering process are employed. Each subsequent iteration of the filtering process identifies at least one new key phrase within the filtered material. In addition, each subsequent iteration takes place with a union of each previously employed key phrase and each new key phrase. As new content is identified, the content is populated to the target corpus.

Abstract: A similar sentence set generation unit 81 groups sentences representing a same concept or event from a set of analysis target sentences, to generate a similar sentence set. A similar sentence set extraction unit 82 extracts, using one or more specific sentence extractors each capable of extracting a specific sentence belonging to a specific classification from the set of analysis target sentences, one or more sentences not extracted by any of the specific sentence extractors from among the sentences belonging to the similar sentence set, as an exclusion similar sentence set.

Abstract: A plurality of segment sets of one or more storage segments of a distributed file system may be created and/or updated. The storage segments may be independently controlled. A placement policy may be assigned to each of the plurality of segment sets. The placement policy may control an initial placement and/or relocation of an object to the one or more storage segments for the assigned storage set.

Abstract: Content can be displayed in different manners on different devices (e.g., having different display sizes) using different layout templates. The techniques discussed herein automatically select a layout template for the content for a particular display device, and transform the content to that layout template for display. Generally, the content is categorized into multiple different categories, and the layout template is also categorized into the same categories. For each of the categories, a mapping of part of the content to a layout element of the layout template is selected. A content display for the layout template is generated by porting (and possibly transforming) the parts of the content into the mapped-to element (as indicated by the selected edges) of the layout. In one or more embodiments, the content display can then be displayed or communicated to another device for display.

Abstract: A method for scanning a local media file is provided. The method includes: receiving a scanning instruction, acquiring an identifier of a storage device, and creating a view table mapped to by a data table; scanning the storage device, so as to acquire path information about a media file in the storage device; comparing the path information about the media file with path information about a media file in the data table, so as to acquire path information about a media file that does not exist in the data table, and storing the same in the data table; and scanning a newly added media file according to path information about the newly added media file in the data table, so as to acquire file information about the media file, and updating a database by adding the acquired file information about the media file.

Abstract: An item recommendation system includes a candidate item database system, a communication module, and a processor. Candidate items to be recommended to a user are stored in the candidate item database system in association with the access items accessed by the user. The communication module acquires one or more access items accessed by the user recently. The processor acquires one or more candidate items and correlation indexes thereof from the candidate item database system based on the one or more access items, and generates an item recommendation list, wherein the item recommendation list comprises the one or more candidate items and recommendation weights thereof, and the recommendation weights are determined based on the correlation indexes.

Abstract: In one embodiment, a method includes receiving a text query inputted by a first user, identifying objects associated with the online social network, each identified object having a name string matching at least in part a portion of the text query, determining a probability score for each identified object that the identified object corresponds to a respective portion of the text query, selecting one or more of the identified objects based on the probability score of the identified object, identifying one or more grammars of a grammar model, each identified grammar having query tokens corresponding to at least one of the selected objects, and sending instructions for presenting suggested queries to the first user, each suggested query comprising the text string, a query token corresponding to one of the selected objects, and one or more additional query tokens of the identified grammar corresponding to the respective selected object.

Abstract: A modular search object framework provides modular search results including entity and non-entity search results. The framework includes circuitry that outputs an interactive entity section based on an online search. The interactive section includes a plurality of moveable visual objects, such as cards that can be shuffled, flipped, or swiped around.

Abstract: In various embodiments, methods and systems, for implementing modular data operations, are provided. A data access request, associated with data, is received at a data access component. The data access component selectively implements modular data operations functionality based on configuration settings. A translation table associated with a working set is accessed, based on the configuration settings of the data access component, to determine a location for executing the data access request. The data access request is executed using the cache store or a backing store associated with the working set. The data access request is executed using the location that is determined using the translation table of the working set. The data access request is executed using the cache store when the data is cached in the cache store and the data access requested is executed based on the backing store when the data is un-cached in the cache store.

Abstract: Disclosed herein are systems, methods, and devices for testing deduplication repositories. Methods may include identifying a storage location based on a request for one or more data values associated with a read-only file system, where the read-only file system is a simulated file system, and where the storage location is identified based on a plurality of request parameters included in the request. The methods may also include generating, using a processor and responsive to the request, the one or more data values based on the plurality of request parameters and a plurality of configuration parameters, where the plurality of configuration parameters enable deterministic generation of all data values stored in the tile system. The methods may further include returning the one or more data values as a result of the request.

Abstract: The present description provides data analysis for machine maintenance scheduling. For example, dynamic maintenance intervals are assigned for each machine being scheduled. Then, a system is provided for implementing a particle swarm optimization for finding an optimized maintenance schedule. In the optimization, an objective function is defined for maximizing production while minimizing relative maintenance cost.

Abstract: A synchronization window for synchronizing data for a calendar in a client calendar data store on a calendar data client computer system with data for the calendar in a server calendar data store on a calendar data server computer system can be calculated using a current time. A request for synchronization data for calendar items for the calendar with calendar times that are within the synchronization window can be sent to the calendar data server. One or more responses to the request can be received from the calendar data server. The response(s) can include received records for calendar items that are at least partially within the synchronization window. The received records can include a master record of a recurring calendar item and an instance record of an occurrence of the recurring calendar item. The received records for the calendar items can be incorporated in the client calendar data store.

Abstract: Techniques for monitoring local and/or remote file systems by a synchronization component (e.g., client/server) of a cloud-based platform are disclosed. In some embodiments, a method of building synchronization events by a synchronization component (e.g., a synchronization server/client) includes obtaining a set of items that have been changed and their new states and retrieving last known states of the set of items that are stored in a reference snapshot inside a filesystem scanner. The method further includes generating differences between the new states and the last known states of the set of items as item changes and utilizing information provided by the item changes to translate the item changes into synchronization events for execution on the opposing file system. A method of handling failed synchronization events by a synchronization component of the cloud-based platform by collapsing a subsequent event with the failed synchronization event is also disclosed.

Abstract: Reducing time required to write a file to tape is provided. Synchronous processing is performed in a file system implementing a Linear Tape File System (LTFS) file format, wherein the synchronous processing includes writing, to a tape medium of a tape cartridge, index information and one or more files. A type of the synchronous processing is determined, wherein the type is either an index-MAM sync type or an index-only sync type. Updated information is stored to a media auxiliary memory of the tape cartridge in response to determining that the synchronous processing is of the index-MAM sync type.

Abstract: Techniques for performing fine-grained metadata management in a distributed file system (DFS) are provided. In one embodiment, each node in a plurality of nodes implementing the DFS can execute a namespace metadata service that is dedicated to managing file system metadata pertaining to one or more namespaces of the DFS. Each node can further execute a data metadata service that is distinct from the namespace metadata service, where the data metadata service is dedicated to managing file system metadata pertaining to properties of data and free space in the DFS.

Abstract: A first computing device is part of a distributed electronic storage system (DESS) that also comprises one or more second computing devices. The first computing device comprises client process circuitry and DESS interface circuitry. The DESS interface circuitry is operable to: receive, from client process circuitry of the first computing device, a first client file system request that requires accessing a storage resource on one or more of the second computing devices; determine resources required for servicing of the first client file system request; generate a plurality of DESS file system requests for the first file system request; and transmit the plurality of DESS file system requests onto the one or more network links. How many such DESS file system requests are generated is determined based on the resources required for servicing the first client file system request.

Abstract: Methods and apparatus for identifying one or more territories are provided. An example method includes receiving, from a data source, a territory file. The territory file can include data describing territory details such as a geographic territory name, territory geometry information, territory data attributes, and a territory color. Territory data is retrieved from a server, based on data in the territory file. A spatial fabric layer including polygonal regions is loaded from the territory data. A visual representation of one or more polygonal regions is displayed with a video display. User data indicating a selection of one or more polygonal regions can be received to create or update one or more selected territory polygonal regions. Changes made to a territory allocation can be displayed on a video display. The territory file can be updated with data identifying the one or more selected polygonal regions, and stored.

Abstract: In one embodiment, a method includes sending, from a client system of a first user to a server of an online social network, an image portraying at least a first person and determining, for each user in a first set of users, a facial-recognition score with respect to the first person portrayed in the image. The facial-recognition score is based at least in part on a facial-representation associated with the user being compared with the image. The method further includes presenting, at the client system, one or more tag suggestions for the first person portrayed in the image based on the facial-recognition scores and a social-graph affinity associated with one or more users of the first set of users and receiving a selection of a particular tag suggestion by the first user. Each tag suggestion corresponds to a particular user of the first set of users.

Abstract: Described is a system and method for enabling visual search for information. With each selection of an object included in an image, additional images that include visually similar objects are determined and presented to the user.

Abstract: The invention includes an algorithmic method for dynamically computing complex relationships among objects of an underlying functional system. The invention includes a method to algorithmically determine a set of functional locations in n-dimensional functional space of a set of elements of a functional system by electronically representing a set of data entities in a database system, the database system comprising a logical data model for structuring data sets from which functional information can be derived, using the logical data model to associate a set of characteristics with a reference point in the functional information system, selecting a functional positioning algorithm, and wherein the functional positioning algorithm executes a set of steps that takes as input a set of characteristics and returns as output a set of locations in n-dimensional functional space.

Abstract: The invention relates to a method, an apparatus, a computer program product for determining metadata for a data item. The method comprises receiving a data item for processing; analyzing content of the data item; generating a set of metadata values based on the analysis of the content of the data item; and using at least a part of the set of metadata values for defining metadata for the data item.

Abstract: The invention relates to an intelligent metadata layer for value-based management of information across multiple data repositories. A method according to an embodiment comprises managing data in one or more data repositories via a centralized content management system, wherein said one or more data repositories are connected to said centralized content management system, wherein said centralized content management system provides an access for one or more client devices to data items in said one or more connected data repositories, wherein the method further comprises identifying a data item by the centralized content management system in at least one of the one or more data repositories; creating centralized content management metadata for said identified data item; and associating the created centralized content management metadata with said identified data item.

Abstract: Schema-less databases can make data modeling and data management difficult and can detrimentally affect integration with an RDBMS. Inferring a schema from a schema-less database can improve integration by indicating a structure or organization of data in the schema-less database. A schema analyzer can infer a schema by processing data of the schema-less database to identify statistically significant data fields. The schema analyzer then creates a schema that comprises the statistically significant data fields. A data modeler can use the resulting schema along with a schema for a RDBMS to generate a unified data model. A user may submit a query based on the unified data model to obtain results from both databases. The data modeler translates the query from the unified model to be compatible with each of the schemas so that data may be written to or retrieved from each of the schema-less database and the RDBMS.

Abstract: Techniques for analyzing and synthesizing complex knowledge representations (KRs) may utilize an atomic knowledge representation model including both an elemental data structure and knowledge processing rules stored as machine-readable data and/or programming instructions. One or more of the knowledge processing rules may be applied to analyze an input complex KR to deconstruct its complex concepts and/or concept relationships to elemental concepts and/or concept relationships to be included in the elemental data structure. One or more of the knowledge processing rules may be applied to synthesize an output complex KR from the stored elemental data structure in accordance with context information. Methods of populating an elemental data structure and methods of synthesizing complex KRs from the elemental data structure may depend on user models, context information, preference information, and/or preference models.

Abstract: Exemplary embodiments of the present disclosure relate to systems, methods, and non-transitory computer-readable media that achieve eventual consistency of interrelated data in a computing system based on a relationship between the interrelated data (e.g., dependencies between interrelated data) and a configuration of an application programmed to consume the interrelated data. Exemplary embodiments can utilize one or more implicit or explicit dependency graphs, such as an implied or explicit directed acyclic graph corresponding to the interrelated data and the dependencies between the interrelated data. Subsets of the interrelated data can be associated with one or more groups or boundaries in the dependency graphs based on a configuration of applications programmed to consume the interrelated data and/or based on the dependencies between the interrelated data.

Abstract: Embodiments of the present disclosure help content providers identify popular topics based on Internet search data, as well as to quantify the popularity of content addressing those topics. A computer-implemented method according to one embodiment of the present disclosure comprises receiving search data by a computer system; identifying a category related to at least a portion of the search data; determining, by the computer system and based on the search data, a topic for content associated with the identified category; and determining, by the computer system, a score indicative of a level of popularity for the topic, wherein determining the score is based on the search data and on one or more formats for the content associated with the topic.

Abstract: Systems and methods for using instrumentation for maintaining user-configured programs in a cloud computing environment are herein disclosed as comprising, in an implementation, intercepting operation data pertaining to the user-configured program, including a start time, an execution time interval, and an origin of the operation, canonicalizing the intercepted operation data by stripping operation-specific variable data from the operation data, aggregating the canonicalized operation data based on the start time, the canonicalized operation data, and the origin of the operation, and storing the aggregated operation data within a time series database in the execution time interval based on the start time.

Abstract: Analysis of system information includes retrieving selected snapshots comprising the system information to be analyzed. Further, one or more operations can be performed on the system information to extract resultant information. The resultant information can be provided over a graphical user interface to a user.

Abstract: The current document is directed to a query-as-a-service system (“QAAS system”) that collects enormous volumes of data from network-connected entities, referred to as “Things” in the phrase “Internet of Things,” persistently stores the collected data and provides a distributed-query-execution engine that allows remote clients to continuously execute queries against the collected data. In a described implementation, both the raw data and query results are persistently stored in the QAAS system, with the raw data stored for significantly longer periods of time. Query results generated by the query-processing engine are securely transmitted to QAAS remote clients for distribution to file systems, storage appliances, applications, and other data sinks within client systems.

Abstract: The present application is directed towards systems and methods for automated analysis and transformation of databases and related applications and functions from a row-oriented syntax to a column-oriented syntax. An analyzer client executed by a processor of a client device may analyze a first database of a business management system comprising a plurality of arrays in a row-oriented syntax. A transformer executed by the processor may execute a first array of a second database having a column-oriented syntax. Iteratively, for each array of the plurality of arrays of the first database, the transformer may read an element at a first position of said array, and write the element to a next position of the first array of the second database.

Abstract: Computer-implemented methods and systems for managing data objects within a computer network infrastructure that facilitate more efficient and reliable data storage and access are provided. An exemplary method may comprise establishing a physical identifier for each storage resource. A plurality of unique virtual identifiers for each storage resource is generated based on the physical identifier. The plurality of unique virtual identifiers is stored in a consistent ring namespace accessible to every node. An object identifier associated with a location of a data object to be stored in a storage resource is generated. The object identifier is mapped to the consistent ring namespace. The method may also include enabling traversing the consistent ring namespace from any node in the computer network to locate and access the data object.

Abstract: A consumer oriented data service is provided. A data collaboration service initiates operations to provide access to data from multiple sources by managing a data table of aggregate data fields based on a request from a client application. The request includes a consumer identification and data queries. An ownership of the data table is assigned based on the consumer identification. Local data fields identified in the data queries are inserted into the data table and populated with local datasets stored in the queries. External data fields identified in the data queries are inserted into the data table and populated with links to external datasets stored in external data sources.

Abstract: A method of timestamping may include choosing a timestamp generation frequency; receiving and caching a first timestamp from a timestamp generator; receiving a first tuple from a data input stream; attaching a cached timestamp to the first tuple from a data input stream and placing the tuple on the output queue receiving a second and third tuple from the data input stream; attaching a cached timestamp to the second and third tuples from a data input stream and placing the tuples on the output queue receiving a second timestamp from the timestamp generator; replacing the first timestamp with the second timestamp; receiving a fourth and fifth tuple from the data input stream; attaching the newer second cached timestamp to the fourth and fifth tuples from a data input stream and placing the tuples on the output queue; and repeating for newly received timestamps and tuples.

Abstract: Multi-thread systems and methods are described for concurrently handling requests to commit data updates to a database by a plurality of data transactions. The database preferably supports multi-versioning and the data transactions are preferably isolated by snapshot isolation. In one embodiment, concurrent and lock-free handling of requests to commit data updates includes performing two types of concurrent data conflict detection. A transaction proceeds to commit only if it passes both types of conflict detection. The first type of conflict detection is based on a hash map between data keys and their commit timestamps whereas the second type of conflict detection is based on a log that keeps track of the status of transactions whose requests to commit are actively being processed. In another embodiment, concurrent conflict detection for data items in concurrent transactions is broken down into buckets and locks are used for accessing each bucket.

Abstract: An event triggering method for use in an event management system which is coupled to a version control server is provided. The method includes the following steps. First, it is detected whether a version control command received from the version control server is a commit command. In response to detecting that the version control command is the commit command, the commit command is decoded to obtain a comment string and the comment string is compared with at least one predetermined string to determine whether they are matched, wherein the predetermined string corresponds to a predetermined event. In response to determining that the comment string and the comment string are matched, triggering of the predetermined event corresponding to the predetermined string is being performed.

Abstract: Embodiments of the present disclosure provide concurrency control, including receiving a plurality of transaction operation requests, where each transaction operation request includes operation object information and operation type information, the operation object information is used to indicate an operation object of the transaction operation request, and the operation type information includes a write operation or a read operation, making a lock-use application according to the at least two transaction operation requests, and determining, according to a requested lock status and a current lock status in the lock-use application, whether the application is passed, and if the application is passed, determining to perform concurrency control on the at least two transaction operation requests by using the requested lock status, where the requested and current lock statuses includes at least three modes: a shared read mode, a shared write mode, and an exclusive mode.

Abstract: A sports information tracking system can be communicably coupled to a device, such that one or more subscribers can request the device to display a profile, wherein the request corresponds to one of the subscribers and causes the profile associated with the subscriber to display on the device. The profiles can be updated based on subscriber submitted data from other subscribers, data gathered from health sensors and performance sensors, and data mined from social media outlets. The system can allow each subscriber to edit at least part of their associated profile. Additionally, the system can be used by subscribers to search for other subscribers to view profiles associated with the other subscribers. The system can also predict injuries, performance ratings, and game results.

Abstract: Techniques are described for providing a guaranteed commit outcome for global transactions that are optimized by deferring the commit processing to a resource manager, such as a DBMS, using optimizations. The “Distributed Transaction Processing: The XA Specification” standard specification is ambiguous regarding commit outcomes for transactions managed by DBMS, resulting in wrong results for vendors implementing the standard. The techniques described provide a guaranteed commit outcome when using the optimizations, creating the opportunity for safe replay of global transactions when a communication error or timeout occurs between the transaction manager and the resource manager, and eliminating ambiguous transaction outcomes reaching applications and end users. Techniques described herein distinguished between global transactions in a session managed by a transaction manager, and those in the same session that are managed by the resource manager using the optimizations.

Abstract: A method for generating a mobile database structure configured to operate when a mobile device is disconnected from an enterprise application server. The method includes receiving a data model and a set of validation rules associated with an enterprise application. The method also includes determining an application role to be performed by the mobile device when disconnected from the enterprise application server. The method also includes storing a set of simplified application data within the mobile device relating to the application role, where the set of simplified application data includes data query definitions configured to map a query data cache to one or more output data fields. The method also includes validating the set of simplified application data based on the set of validation rules. The method also includes generating a interface for the mobile device, where the interface is configured to contain functionality based on the application role.

Abstract: A method, a computing device, and a non-transitory machine-readable medium for assessing data segments for garbage collection is provided. In some embodiments, the method includes identifying a plurality of data segments. A first rate at which data within each of the plurality of data segments has been invalidated since a first point in time is determined, and a second rate at which data within each of the plurality of data segments has been invalidated since a second point in time subsequent to the first point in time is determined. The second rate is compared to the first rate for each of the plurality of data segments, and a garbage collection score is assigned to the respective data segment based on the comparison. The garbage collection score may be further based on a utilization of the respective data segment and/or an age of the respective data segment.

Abstract: An embodiment of the invention may include a method, computer program product and system for processing a transaction. The embodiment may include receiving a transaction request by a first transaction processing monitor from a plurality of transaction processing monitors. The transaction request contains details for updating a global database. The embodiment may include determining whether the global database has begun updating based on the transaction request. Determining whether the global database has begun updating includes checking a transaction state database. The embodiment may include determining that the global database has not begun updating, and updating an entry in the global database based on the details contained in the transaction request.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Abstract: A method may include applying periodically a data validation rule to data transformed through a data processing system, wherein the data validation rule applies aspects selected from a group consisting of data value range, specific data values, and relationship with other data entries; responsive to detecting a violation of the data validation rule, identifying a portion of the transformed data for lineage assessment; examining the identified transformed data iteratively upstream at a previous transformation node in a lineage graph, until the method detects a node where the violation of the data validation rule can't be reproduced; creating a separate node in a distributed network for each of the previous transformation nodes in the lineage graph; and identifying the separate node in the distributed network introducing the violation of the data validation rule.