Abstract: Various technologies described herein pertain to controlling geo-scale analytics with bandwidth and regulatory constraints. An analytical query (e.g., a recurrent analytical query, a non-recurrent analytical query, etc.) to be executed over distributed data in data partitions stored in a plurality of data centers can be received. Moreover, a query execution plan for the analytical query can be generated, where the query execution plan includes tasks. Further, replication strategies for the data partitions can be determined. A replication strategy for a particular data partition can specify one or more data centers to which the particular data partition is to be replicated if the particular data partition is to be replicated. The tasks of the query execution plan for the analytical query can further be scheduled to the data centers based on the replication strategies for the data partitions. The analytical query can be part of a workload of analytical queries.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: Methods and apparatus to search datasets are disclosed. An example disclosed apparatus includes a grouper to reference statistics associated with a database to identify which criterion of a group of logically related criteria of a search request satisfies fewer ones of records in the database, an identifier to select the identified criterion of the group of logically related criteria as a driving criterion for the group of logically related criteria, a reduced set generator to form a subset of the records of the database based on the driving criterion, and an analyzer to reduce a search time associated with the search request by searching the subset of the records for a non-driving criterion of the group of logically related criteria.

Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.

Abstract: Systems for performing inline wire speed data deduplication are described herein. Some embodiments include a device for inline data deduplication that includes one or more input ports for receiving an input data stream containing duplicates, one or more output ports for providing a data deduplicated output data stream, and an inline data deduplication engine coupled to said one or more input ports and said one or more output ports to process input data containing duplicates into output data which is data deduplicated, said inline data deduplication engine having an inline data deduplication bandwidth of at least 4 Gigabytes per second.

Abstract: In accordance with an embodiment, described herein are systems and methods for providing direct access to a sharded database. A shard director provides access by software client applications to database shards. A connection pool (e.g., a Universal Connection Pool, UCP) and database driver (e.g., a Java Database Connectivity, JDBC, component) can be configured to allow a client application to provide a shard key, either during connection checkout or at a later time; recognize shard keys specified by the client application; and enable connection by the client application to a particular shard or chunk. The approach enables efficient re-use of connection resources, and faster access to appropriate shards.

Abstract: A stream computing application may receive a stream of tuples to be processed by a plurality of stream operators. A first stream operator may receive a data stream, and the first stream operator may be configured to accumulate the data stream according to a window before performing one or more operations and transmitting tuples to a second stream operator. The second stream operator may request that the first stream operator send out tuples before the first stream operator's window has terminated. In response, the first stream operator may perform its operations on the tuples that it had accumulated before the request came in and then transmit a group of tuples with the intermediate results to the second stream operator.

Abstract: A lockless open collection data structure used to create a sequence of collection records. The sequence of collection records may be inserted into a data stream for purposes of assisting in subsequent processing of the data stream in a parallel manner, by collection. The open collection data structure is re-usable for multiple collections of data items within the data stream. The use of the open collection data structure may occur while a data stream that includes multiple different types of data items is being evaluated. The open collection data structure is used to track an expandable collection definition of a currently open collection. Upon detecting that the collection definition is no longer expandable, the collection record is created based on state within the open collection data structure. Once the collection record for a collection has been created, the open collection data structure becomes available for the next collection record.

Abstract: A stream computing application may receive a stream of tuples to be processed by a plurality of stream operators. A first stream operator may receive a data stream, and the first stream operator may be configured to accumulate the data stream according to a window before performing one or more operations and transmitting tuples to a second stream operator. The second stream operator may request that the first stream operator send out tuples before the first stream operator's window has terminated. In response, the first stream operator may perform its operations on the tuples that it had accumulated before the request came in and then transmit a group of tuples with the intermediate results to the second stream operator.

Abstract: Automatic content sequence generation may include receiving a request to access a sequence of content, identifying a primary metric and a secondary metric associated with the sequence of content, automatically identifying a second plurality of content objects from a first plurality of content objects, such that each of the second plurality of content objects has a determined similarity with the primary metric above a minimum similarity threshold, automatically identifying a third plurality of content objects from the second plurality of content objects, such that a percentage of the third plurality of content objects for which the determined similarity is above an authorship threshold corresponds with the primary metric, automatically identifying the sequence of content based on the third plurality of content objects, automatically identifying a sequentially first content object from the sequence of content, and outputting the sequentially first content object for presentation to a user.

Abstract: Concepts and technologies are described herein providing technologies for mining patterns in temporal data streams. Data is broken into data sub-portions. Dependencies in computation between one or more of the data sub-portions are broken using symbolic data types. Symbolic summaries of computations of sub-portions are performed in parallel and are reduced to generate an output.

Abstract: Systems and methods prevent or restrict the mining of content on a mobile device. For example, a method may include identifying a mining-restriction mark in low order bits or high order bits in a frame buffer of a mobile device and determining whether the mining-restriction mark prevents mining of content. Mining includes non-transient storage of a copy or derivations of data in the frame buffer. The method may also include preventing the mining of data in the frame buffer when the mining-restriction mark prevents mining.

Abstract: In certain implementations, data visualization of streaming data may be facilitated. In some implementations, a request for visual representation of values associated with an attribute may be received. Queries for data relating to the values across a plurality of sources may be performed based on the request. The queries may include a first subset of queries and one or more other subsets of queries that are performed based on the request. Subsets of data that relate to a first value of the values may be received based on the first subset of queries. The first value may be predicted based on the subsets of data before one or more other subsets of data relating to the first value are received, where the one or more other subsets of data are received based on the one or more other subsets of queries.

Abstract: Systems and methods for electronic data indexing support user-side scripting through an application program interface (API). In some aspects, a user-script generates target data using third party software programs. The user-script sends parameters through the API to an indexing engine. The parameters identify the target data to the indexing engine for processing, analyzing, and performing operations.

Abstract: There are provided asset-data integration systems and methods for use by such systems. Such a system includes a hardware processor, a system memory, and an asset-data synthesis unit including a data translation module and a data integration module, stored in the system memory. The system is configured to receive domain specific asset description data expressed using different descriptive vocabularies, and to translate the domain specific asset description data to produce common format asset description data. The system is further configured to identify the common format asset description data describing the same asset, to integrate that common format asset description data to produce an integrated asset description data describing the asset, and to generate a synthesized data describing the asset and linking the integrated asset description data and the domain specific asset description data.

Abstract: Disclosed is a software device (“Synchronizer”) incorporating functional synchronization and data level synchronization to maintain semantic equivalence between data elements of at least two data stores. The synchronizer may be configured to operate as a pure uni-directional data level synchronizer with data model remapping and business rule validation of the data or as a pure bi-directional functional synchronizer with data remapping and transaction remapping. Additionally, the Synchronizer can operate as a hybrid of data level synchronization occurring below the business logic layer of the program and of functional synchronization occurring in the business logic layer.

Abstract: According to one embodiment, a system includes a processor and logic integrated with and/or executable by the processor. The logic causes the processor to receive, at a remote site connected to a production site via a network, an incremental file list from the production site, each incremental file indicated by the incremental file list being either updated or new as determined during a time period between a data image at a previous synchronization (sync) point and a data image at a current sync point. The logic also causes the processor to tally a remote access count of each incremental file on the incremental file list received at the remote site by users at the remote site, record the tallied remote access counts in the incremental file list at the remote site, and transfer the incremental file list including the tallied remote access counts to the production site.

Abstract: Method and systems for sharing product data involved in a supply chain among a plurality of subscribers to an on-demand database is described. Data related to a product is received from a first subscriber and stored into a first section of the on-demand database reserved for the first subscriber. The first subscriber then communicates a request to share the product data with one or more second subscribers. Once the first subscriber receives an acceptance from the one or more second subscribers, the product data is stored in a second section of the on-demand database reserved for the second subscriber. Changes made to the data associated with the product are synchronized between the two subscribers.

Abstract: A method for synchronizing data among heterogeneous data sources is disclosed. The method may comprise obtaining a synchronization task and a corresponding operation classification, determining one or more Reader plugins and Writer plugins based on the corresponding operation classification, segmenting the synchronization task based on the one or more Reader plugins and Writer plugins to generate a Task queue, and using a corresponding number of the Reader plugins and the Writer plugins based on the Task queue to implement the synchronization task. The one or more Reader plugins may be configured to read data from a source and to send to the one or more Writer plugins, and the one or more Writer plugins may be configured to write the data to a destination.

Abstract: A computer system that provides search functionality relative to people in an organization includes a processor and a data store containing profile information relative to the people in the organization. A query processing engine is coupled to the processor and is configured to execute queries against the data store. The processor is configured to receive user input information indicative of a name and responsively generate a first query. The query processing engine is configured to execute the first query against only a name field relative to the profile information and return a first query result. The query processing engine is configured to selectively, automatically execute a second query against at least one additional field of the profile information if the first query result is empty, and return second query results.

Abstract: A business intelligence (BI) computing system obtains a plurality of relational data records from a data source that has an associated hierarchy description. The BI computing system, using the hierarchy description, next builds a hierarchical structure of the plurality of data records. Subsequently, the BI computing system, using the hierarchical structure, initiates at least one hierarchical workflow operation to allow a user to display, analyze, and navigate the plurality of data records on a BI client. Related apparatus, systems, techniques and articles are also described.

Abstract: A system and a method for capture, classification and dimensioning of data. Particularly, a system and a method for capture, classification and dimensioning of spatiotemporal texture data associated with the micro-expression temporal dynamic features, or involuntary expressions having a very short duration, to generate a personal expression-relevant classified data profile by using a mobile device in a user-friendly and time-efficient manner responsive to user's needs.

Abstract: A data intake and query system measures an amount of raw data ingested by the system during defined periods of time. As used herein, ingesting raw data generally refers to receiving the raw data from one or more computing devices and processing the data for storage and searchability. Processing the data may include, for example, parsing the raw data into “events,” where each event includes a portion of the received data and is associated with a timestamp. Based on a calculated number of events generated by the system during one or more defined time periods, the system may calculate various metrics including, but not limited to, a number of events generated during a particular day, a number of events generated per day over a period of time, a maximum number of events generated in a day over a period of time, an average number of events generated per day, etc.

Abstract: Techniques for analyzing media content are described. One technique generally comprises performing a regression analysis for characters in a plurality of media content based on user demographics, content outcome measure, and character models. The technique determines an attribute of significance. In some embodiments, the technique selects media content for display that depicts a character having at least a threshold value of the attribute of significance. In some embodiments, the technique displays media analytics for the attribute of significance determined based on a value of the attribute of significance exceeding a threshold significance value.

Abstract: A method includes storing documents of different fields, and a relationship between any two documents of different fields, performing word segmentation and stop word removal on the documents of different fields, to obtain a vocabulary data set for the documents of different fields, constructing an incidence matrix between the documents of different fields according to the relationship between the any two documents of different fields, obtaining a topic cluster of the documents of different fields according to the vocabulary data set, obtaining a probability that any topic in the topic cluster appears in any document and a matching weight of the any topic for any two different fields according to the incidence matrix and the topic cluster, and computing a similarity between the any two documents according to the probabilities and the matching weight of the any topic for the fields to which the any two documents belong.

Abstract: A method, computer program product and computing device for selecting at least one playlist for transfer, the at least one playlist being stored on a first personal media device. The at least one playlist is converted to a common format, thus generating a first common format playlist. Communication is established with a second personal media device. The first common format playlist is transferred to the second personal media device.

Abstract: An apparatus for predicting a command in a command line interface includes a template command module, a parameter derivation module, and a parameter substitution module. The template command module is configured to determine a template command based on a command line history. The template command includes a command name and a parameter and the command line history includes two or more previously entered commands. The parameter derivation module is configured to determine a parameter derivation rule for deriving the parameter in the template command based on the command line history. The parameter substitution module is configured to substitute a substitute parameter for the parameter of the template command according to the parameter derivation rule.

Abstract: The disclosure is related to systems and methods of detecting information via natural language processing. A processing system can be configured to perform natural language processing on a selected set of documents and detect information in the documents. The information may be based on binary questions identified by a client, such as personally identifiable information. The natural language processing can be performed using statistical models, such as frequency analysis, hidden Markov models, or neural networks.

Abstract: This invention relates to a system for and a method (100) of searching a collection of digital information (150) comprising a number of digital documents (110), the method comprising receiving or obtaining (102) a search query, the query comprising a number of search terms, searching (103) an index (300) using the search terms thereby providing information (301) about which digital documents (110) of the collection of digital information (150) that contains a given search term and one or more search related metrics (302; 303; 304; 305; 306), ranking (105) at least a part of the search query search result according to one or more predetermined criteria providing a ranked search result, and providing at least a part of the ranked search result (106), wherein the ranking provides robust likelihood for low count terms by using the one or more search related metrics (302; 303; 304; 305; 306).

Abstract: Disclosed are systems, apparatus, methods and computer-readable storage media for combining topic suggestions from different topic sources to assign to textual data items. In some implementations, a first automated topic source provides one or more first topic suggestions to associate with a textual data item. Each first topic suggestion has a respective first characteristic, which can be adjusted. A second automated topic source provides one or more second topic suggestions to associate with the textual data item. Each second topic suggestion has a respective second characteristic, which can be adjusted. The first and second topic suggestions are combined to define a combined list. A reference value is determined or retrieved to impact ordering of the topic suggestions in the combined list.

Abstract: Systems and methods for exchanging a data stream of information that varies over time using a message format. The message format includes a version field that indicates a version of a structure of the message format. The message format also includes one or more resources fields that each identifies a resource to be imported into the data stream exchanging the data stream. Moreover, the message format includes one or more records that represent time-variant data samples being exchanged in the message. Furthermore, the message format includes one or more descriptor fields, wherein each descriptor field corresponds to at least one respective record of the one or more records and contains metadata describing data contained within the at least one record.

Abstract: A method and apparatus for identifying audio information, which fall within the technical field of audio identification, are provided. The method for identifying audio information includes obtaining audio that is being played, extracting audio features from the audio, transmitting the audio features to a server, the audio features being matched with audio information stored in the server, receiving the audio information from the server, displaying a hyperlink including a keyword in the audio information on a screen of a device, and displaying prestored information corresponding to the keyword. The audio information of the audio that is being played is obtained by identifying the audio, the hyperlinks that are configured for the keywords in the audio information are displayed, and the prestored information corresponding to the keywords is displayed when the jump link is triggered.

Abstract: The present disclosure relates to network data analysis technology, and discloses a method and an apparatus for recommending a network service. The method includes: acquiring a historical browsing record of each user account on a network service; establishing a browsing sequence of each user account according to the historical browsing record corresponding to each user account; mapping the browsing sequence of each user account to a mapping value; aggregating all user accounts according to the mapping value corresponding to each user account, to obtain at least one user account group; and recommending the network service to each user account based on a user account group to which the user account belongs. The present disclosure improves an accuracy rate of whether a recommended network service satisfies an interest of a user in the network service.

Abstract: The present invention relates to a media content ordering system and to a method for ordering media content. According to the invention, media content items are ordered in two different spaces, i.e. metadata space and feature space. This allows a user to select and retrieve desired content more easily. Media content that is clustered in either space represents similar media content. Suggestions can be made to the user taking into account the preferences of the user with respect to features and metadata particulars. By minimizing the difference in order in both spaces, it is ensured that suggestions to a user are close both in feature space and metadata space.

Abstract: Data is exported by at least one remote computing system to a client computing device that includes a state description characterizing a navigation state of a business intelligence (BI) application executing on the client computing device that interacts with the at least one remote computing system having at least one associated data source. Thereafter, the at least one remote computing system adjusts a query view state to retrieve a data set corresponding to the current navigation state. Next, metadata of a query and its objects are retrieved and exported that correspond to the adjusted query view state to the client computing device. Further, a data set from the at least one associated data source to the client computing device is retrieved and exported that uses the adjusted query view state.

Abstract: A method and system for determining a property of a user in a social network platform are provided according to some embodiments of the present disclosure. The method includes: determining a property of a seed user in the social network platform; determining a property of a social network platform function interacting with a user according to a property of the user in the social network platform; and determining a property of a user interacting with a social network platform function according to a property of the social network platform function. By the embodiments of the present disclosure, the property of the user in the social network platform can be determined accurately.

Abstract: The disclosure discloses a method and an apparatus for determining a core word of an image cluster description text. The method comprises segmenting the each image description text in the text cluster, and based on attribute information of each base word, determining a fractional value of the each base word in the each image description text and a total fractional value of the each base word in the text cluster, and thus determining a core word of the image cluster. Embodiments of the present disclosure may determine a weight of each base word in the each image description text, determine a total fractional value of the each base word in the text cluster, based on the total fractional value of the each base word, determine a core word of the image cluster, and thus can ensure that the selected core word can accurately describe a meaning of the image cluster.

Abstract: An efficient fact checking system analyzes and determines the factual accuracy of information and/or characterizes the information by comparing the information with source information. The efficient fact checking system automatically monitors information, processes the information, fact checks the information efficiently and/or provides a status of the information.

Abstract: The invention provides methods, apparatuses and systems for linked and personalized extended search, wherein the method for linked extended search comprises: a server receiving a search request sent by a user terminal, wherein the search request carries a first keyword that a user wants to search; according to the first keyword, searching to obtain a sorted result of first document data associated with the first keyword; according to the first keyword, determining a second keyword associated with the first keyword; and according to the second keyword and a sorting parameter corresponding to the sorted result of the first document data, searching to obtain a sorted result of second document data. As compared to the prior art, the effectiveness of the search result obtained by employing the method provided by the embodiment of the invention is higher.

Abstract: A computer determines social media influencers in a specific topic by receiving a dataset of information associated with a website, the information including a first list of users of the website and a list of content that each user posts on the website, wherein each user is associated with other users from the first list of users. The computer determines initial values representing variables of the dataset of information on the website, wherein the variables include one or more topics for the list of content that each user from the first list of users posts on the website. The computer performs an iteration of Gibbs Sampling utilizing the initial values. The computer determines the one or more new values representing variables of the dataset represent a distribution of the one or more topics for the list of content that each user from the first list of users posts.

Abstract: Structured information about nodes may be generated and shared using sub-nodes. A node in a social networking system may be associated with sub-nodes that are definable by the node owner, such as menu items for a restaurant or songs in playlists for an artist. Users of the system may interact with the sub-nodes, and the interactions may be presented back on the page to a user, aggregated according to the user's connections in the social networking system (e.g., which songs your friends listened to the most by the artist, which menu items were consumed the most). Users may associate other sub-nodes to the node, such as identifying other menu items served by a restaurant, and the node owner may confirm these associations. Location awareness functionalities may be used to inform a user of highly recommended sub-nodes nearby as indicated by other users of the social networking system.

Abstract: A system and method for generating a score for a listing are described. A data field of a listing is parsed and at least one element from the data field is generated. A score for the listing is calculated based on the at least one element, the listing score representing a probability of the listing being in one of two binary classifications. The listing score and one or more listing attribute values are inputted into a binary classifier. An output is generated using the binary classifier, the output representing a refined score for the listing based on the listing score and at least one of the listing attribute values.

Abstract: Embodiments of the present invention provide a method and an apparatus for discovering a closely related user. The method includes: acquiring first data of a first user on social media and second data of a second user on the social media, where the second user is a user following the first user and/or a user followed by the first user; then, establishing a user model of the first user according to the first data and the second data; then, acquiring third data of a third user in social media, where the third user and the first user do not follow each other; afterward, performing matching between the third data and the user model to perform calculation, to obtain a matching result; and finally, if the matching result is greater than a preset value, determining that the third user is a closely related user of the first user.

Abstract: Generating a 2D barcode includes acquiring private information input by a user and sending the private information to a server through a network. The method includes receiving an information access address returned through the network by the server, and generating a 2D barcode including the information access address. The method further includes acquiring a 2D barcode including an information access address and scanning the 2D barcode to obtain the information access address included in the 2D barcode, the information access address being for accessing private information. The method further includes sending the information access address to a server through a network, and receiving the private information returned through the network by the server, and using the private information as a reading result of the 2D barcode.

Abstract: Disclosed is a URL purification method including the steps of: matching an original URL with a domain name in a domain name set which is capable of being purified; locating a successfully-matched domain name to a corresponding URL template set; matching the original URL with a regular expression of a URL template in the URL template set; determining whether the template in which the regular expression is matched successfully includes a command word; if yes, processing the URL according to the command word, if not, returning to the original URL; and outputting a purified new URL. The disclosure further discloses a URL purification device. After a URL with many forms is purified, whether the URL has been crawled may be determined, and the URL is not crawled again if it has been crawled before, thereby significantly improving the capability of crawling valid web pages by a crawler, and saving various resources.

Abstract: Embodiments of the present disclosure disclose a method and a device for webpage preloading. The method includes: conducting webpage preloading according to a current preloading policy, in which the preloading policy includes: a preloading time range, a preloading region, a preloading page depth, and an available caching space for preloading; counting historical data within a pre-set time period, in which the historical data includes: information about an accessed webpage, information about a preloaded webpage, and state information of a local cache; and updating the preloading policy based on the historical data. In the present disclosure, by way of counting the preloading historical data within a pre-set time period, and based on the changes in the historical data, the preloading policy is automatically updated, so that the preloading policy can adapt to network and user access conditions in real time, thereby improving the hit accuracy of webpage preloading.

Abstract: Systems and methods are provided for predicting user browsing behavior and developing a personalized pre-fetching strategy. In some embodiments, a user equipment entity identifies web pages that are linked from a page being visited by a user, and, based on a user model, determines pre-fetch weights for the linked pages. The user equipment then pre-fetches the web pages with weights above a pre-fetch threshold. In some embodiments, the pre-fetch strategy is generated by or with the assistance of a separate network entity, which may be a distributed logical entity. Policies may also be enforced, such as avoiding pre-fetching while a user is on the telephone, or avoiding pre-fetching of pages containing video.

Abstract: Traversal hooks are based on an event-oriented programming model and provide an expressive mechanism to extend a graph traversal operator with domain-specific coding. A traversal operator can visit (i.e., traversal events) vertices and edges of a graph in an ordered manner. Related apparatus, systems, techniques and articles are also described.

Abstract: A graph data query method and apparatus are disclosed, where the method includes: acquiring a partition number and a layer number of a query vertex; determining, based on the partition number and the layer number of the query vertex, a partition number and a layer number of a candidate vertex indicated by a query condition, and using the partition number and the layer number of the candidate vertex respectively as a candidate partition number and a candidate layer number; forming a candidate set using a vertex whose partition number and layer number satisfy any group of a candidate partition number and a candidate layer number; and performing graph data query in the candidate set according to the query condition.

Abstract: A method of recommending a query word using a domain property includes receiving a search keyword from a terminal of a user, the search keyword being input by the user; generating at least one recommendation query word concerned with the search keyword by using a property of an object of a domain when the search keyword belongs to the object of the domain; and providing the recommendation query word to the terminal of the user as an autocomplete query word for the search keyword.