Abstract: A method, a computer program product, and a computer system for selecting songs using a heart rate change, a blood pressure change, and a facial expression of a listener. A computer receives a song from a music source selected by a listener and determines whether the song is appropriate. The computer starts to play the song, in response to determining that the song is appropriate. A camera connected to the computer detects a facial expression of the listener. The computer determines whether the facial expression is positive. In response to determining that the facial expression is positive, the computer the song in full. The camera connected to the computer detects a heart rate change and a blood pressure change of the listener. The computer tags the song with updated information.

Abstract: A search engine optimization system is provided with an on-line social network system. The on-line social network system includes or is in communication with a search engine optimization (SEO) system that is configured to prioritize keywords (potential search terms) based on their respective predicted contribution to the ranking of JSERPs. The value of a job-related keyword is expressed as a priority score assigned to that keyword. The SEO system generates priority scores for different keywords, using a probabilistic model that takes into account a value expressing how likely the keyword is to be included in a search query as a search term and/or a value expressing how likely is a search that includes the keyword as a search term is to produce relevant results.

Abstract: A machine may be configured to control servicing of data requests in a data migration system. For example, the machine receives a request to access data pertaining to a member of a Social Networking Service (SNS) from a client device. The request references a member identifier of the member. The machine identifies, based on the member identifier, a control signal value that indicates a migration state of a migration of member profile data associated with the member identifier from one or more legacy databases to a consolidated database. The control signal value is associated with member identifiers of one or more members of the SNS including the member of the SNS. The machine causes a servicing of the request to access the member profile data pertaining to the member of the SNS from the consolidated database or the one or more legacy databases based on the control signal value.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a feature clustering of users, user correlation database access, and user interface generation system. The system can obtain information stored in different databases located across geographic regions, and determine unique users from the different information. The information can be included in unique records in the databases, with each record describing a particular user, and with each user described with imperfect identifying information. The system can analyze the different information utilizing machine learning models, and can associate each record with a particular unique user. The system can obtain identifications of items associated with each user, and determine the propensity of the user to disassociate with one or more items, or determine likelihoods of future association with different items not presently associated with the user.

Abstract: According to examples, intelligent data munging may include ascertaining data that is to be transformed, and determining, based on an analysis of the ascertained data, a sample of the ascertained data. Intelligent data munging may further include enriching the sample of the ascertained data, determining features of the enriched sample of the ascertained data, and determining, based on the features, a transformation to be applied to the enriched sample of the ascertained data to transform the enriched sample of the ascertained data from a first format to a second format. Further, intelligent data munging may include validating the determined transformation, and generating, based on the validation of the determined transformation, a script that is to be applied to the ascertained data to transform the ascertained data from the first format to the second format.

Abstract: A system includes reception of a first request for a lock on a lock object, storage of a first entry associated with the first request and the lock object in a queue, determination of a first queue position associated with the first entry based on a first priority level of the first request and on a priority level of each of a plurality of entries in the queue associated with the lock object, determination of whether a predetermined expiration time associated with the first request has expired, and, if it is determined that the predetermined expiration time has expired, deletion of the first entry from the queue.

Abstract: A method for validating user-submitted profile data includes: receiving, by a receiving device, profile data and a user identifier from a first entity, wherein the profile data and the user identifier are associated with a user and where the profile data includes a plurality of unverified data values; transmitting, by a transmitting device, at least the user identifier to a second entity; receiving, by the receiving device, a plurality of corresponding data values from the second entity; and validating, by a processing device, at least one unverified data value of the plurality of unverified data values based on a correspondence to a corresponding data value of the plurality of corresponding data values.

Abstract: Modifying a compressed block of data, including: splitting the compressed block of data into a leading compressed portion and a trailing compressed portion, wherein neither the leading compressed portion nor the trailing compressed portion includes an outdated portion of the compressed block of data; creating an updated compressed block to replace the outdated portion; and combining the leading compressed portion, the updated compressed block, and the trailing compressed portion.

Abstract: Methods for database management in a distributed system are provided, wherein the distributed system at least includes a plurality of servers. The method includes the steps of: collecting transactions to be executed, wherein each transaction corresponds to a plurality of requests and each request is associated with at least one data; generating a transaction dependency graph corresponding to the requests according to data dependency among the data associated with the requests of all the transactions; partitioning the transaction dependency graph to generate a plurality of partitions corresponding to the servers; generating execution plans corresponding to the partitions; distributing the transactions to the servers for execution based on the generated execution plans.

Abstract: A first state identifier is determined according to the state of a first file at a first time point, and a second state identifier is determined according to the state of a second file at a second time point. The first and second state identifiers are compared and an alignment indication is displayed to a user of a client device thereby making the user aware of the alignment state between the files. The files may be associated with different client devices or different users thereby showing group alignment. The files may also be associated with a single user or client device thereby showing local alignment. The state identifiers may include digest hashes of content of the first and second files, metadata, or state information regarding the files. The files may be encrypted and access check keys utilized to determine whether a client device is authorized to receive an encrypted file.

Abstract: The present teaching relates to methods, systems, and programming for reconciling or merging real time data with bulk data. In one example, a first attribute value is obtained. The first attribute value characterizes an aspect of a data item. A second attribute value related to the first attribute value is obtained. The second attribute value characterizes the aspect of the data item. A scheme is selected to be used to determine a third attribute value to characterize the data item. The third attribute value is determined in accordance with the selected scheme as well as the first and second attribute values.

Abstract: Apparatuses and methods for automatic query processing are disclosed, which includes a query analyzer configured to a query analyzer configured to extract the query condition from the input query, a scheduler configured to create one or more sub-queries to verify whether the query condition is satisfied, and to determine an execution condition for the one or more sub-queries, and a condition verifier configured to execute the one or more sub-queries according to the determined execution condition, and to verify whether the query condition is satisfied using results of executing the one or more sub-queries.

Abstract: A method for comparing and analysing digital documents includes searching for unambiguous roots in both documents. These roots are unique units that occur in both documents. The roots can be individual words, word groups or other unambiguous textual formatting functions. There is then a search for identical roots in the other document (Root1 from Content1, and Root2 from Content2, with Root1=Root2). If a pair is found, the area around these roots is compared until there is no longer any agreement. During the area search, both preceding words and subsequent words are analysed. The areas that are found in this way, Area1 around Root1 and Area2 around Root2, are stored in lists, List1 and List2, allocated to Doc1 and Doc2. This procedure is repeated until no roots can be found any longer. The result is either a remaining area that has no overlaps, or complete identity of the documents.

Abstract: Providing an encrypted search index for performing searches on encrypted documents, the method comprising: (i) providing a set of documents, the documents comprising a plurality of unencrypted phrases; (ii) providing a master key; (iii) providing, based on the master key, for each phrase a set of encryption keys comprising one or more encryption keys; (iv) selecting, for each phrase, one encryption key of the set of encryption keys; (v) encrypting each phrase with the selected encryption key; and (vi) building an index based on the encrypted phrases, the index comprising information regarding which encrypted phrase is comprised within a certain document.

Abstract: An apparatus for processing queries in a heterogeneous index. The apparatus comprises a receiver configured to receive a query from a user, wherein the query comprises at least one desired attribute of a desired file, and a processor coupled to the receiver and configured to search the heterogeneous index. The processor is configured to search the heterogeneous index by receiving the query from the receiver, testing a bloom filter of a storage partition in the heterogeneous index for existence of the desired attribute after receipt of the query, ignoring the storage partition and proceeding to a next storage partition in the heterogeneous index when the bloom filter indicates that the desired attribute is not present in the storage partition, and searching the storage partition to determine which one or more files of the storage partition have the desired attribute when the bloom filter indicates that the desired attribute is present in the storage partition.

Abstract: An apparatus and method for information presentation based on a service object.

Abstract: A method for optimizing an area of a ternary FPRM circuit using population migration algorithm, the method including: 1) establishing an area estimation model of the ternary FPRM circuit; 2) establishing a corresponding relationship between the ternary FPRM circuit and population migration algorithm; 3) setting an attraction function for calculating the attraction of the population location in population migration algorithm; 4) setting relevant parameters of population migration algorithm; and 5) employing population migration algorithm to calculate and obtain the greatest attractive site and the greatest attraction.

Abstract: The optimized inequality join method is a method for joining relational tables on input inequality conditions. The optimized inequality join method is a relatively fast inequality join method using permutation arrays to store positional information for sorted attributed values. Additionally, space efficient bit arrays are used to enable optimization, such as Bloom filter indices, thus providing faster computation of the join results. The method may be used, for example, for joining various inequalities associated with a variety of measured environmental conditions for raising an alarm when certain conditions are met.

Abstract: Mechanisms are provided for ingesting natural language textual content. Ingestion of natural language textual content is initiated and an embedded structured data portion within the natural language textual content is identified. A signature of the structured data portion is generated which comprises one or more metadata elements describing the configuration or content of the structured data portion. References to the structured data portion are identified in natural language text portions of the natural language textual content and evaluated based on the signature. An ingestion prioritization plan for ingesting a set of facts associated with a set of elements of the structured data portion is generated based on results of the evaluation. The ingestion prioritization plan is applied to generate the set of facts and store the set of facts in an ingested representation of the natural language textual content.

Abstract: A computer-implemented method includes identifying a query, including one or more predicates and one or more branches, wherein one or more branches includes one or more legs. The computer-implemented method further includes, for each branch, in parallel: determining a risk, determining a return row threshold, estimating a number of return rows; terminating access if the return rows exceed the threshold. The computer-implemented method further includes, for each leg, in parallel: determining a leg return row threshold; accessing the leg; fetching one or more return rows into one or more leg return row pages; terminating access if the return rows exceed the threshold; intersecting one or more leg return row pages into one or more intersected leg return row pages; and applying the one or more predicates to the one or more intersected leg return row pages. The method may be embodied in a corresponding computer system or computer program product.

Abstract: Disclosed herein are technologies for facilitating optimization of pattern queries. In accordance with one aspect, jumbo query plans are generated by applying at least one sharing technique and combining at least two of the pattern queries. Costs of the jumbo query plans may then be estimated and used to search for an optimal query plan. The optimal query plan may then be executed on an input data stream to generate an output data stream.

Abstract: An original query execution plan of a database query is received. The original query execution plan represents a tree of operators. Source code for the original query execution plan is generated by a single traversal of the tree of operators. The generated source code is compiled into native machine code. The native machine code represents a simplified native access plan (SNAP).

Abstract: A computer-implemented method includes identifying a query, including one or more predicates and one or more branches, wherein one or more branches includes one or more legs. The computer-implemented method further includes, for each branch, in parallel: determining a risk, determining a return row threshold, estimating a number of return rows; terminating access if the return rows exceed the threshold. The computer-implemented method further includes, for each leg, in parallel: determining a leg return row threshold; accessing the leg; fetching one or more return rows into one or more leg return row pages; terminating access if the return rows exceed the threshold; intersecting one or more leg return row pages into one or more intersected leg return row pages; and applying the one or more predicates to the one or more intersected leg return row pages. The method may be embodied in a corresponding computer system or computer program product.

Abstract: A method and system of a data join includes capture of metadata information associated with one of semi-structured data and unstructured data. A flattened structure for one of the semi-structured data and the unstructured data is defined, and an entity is extracted from the unstructured data. Further, one of the semi-structured data and an entity extracted unstructured data are flattened based on the flattened structure, and flattened semi-structured data and flattened entity extracted unstructured data with relational data are joined.

Abstract: Point Search is a device, system and method of social search wherein currently disconnected people can get in contact by making a search on a common point, where the point can be a circumstance, location, event etc. Point Search applies to a variety of relationships between people that seek to get in contact, including: people that had a strong relationship of any kind, at any time in the past, but which people are currently disconnected and with no contact reference to each other; strongly related people that are currently disconnected by external circumstances (natural disasters, abductions, wars, social unrests, quarantines etc.); disconnected and unrelated people, but sharing a same location, event, interest or circumstance at the same time; and other relationships, as it will become apparent from the detailed description of this invention.

Abstract: According to non-limiting embodiments disclosed herein, the functionality of an object cache in a server can be extended to monitor and track web traffic, and in particular to perform rate accounting on selected web traffic. As the server communicates with clients (e.g., receiving HTTP requests and responding to those requests), the server can use its existing object cache storage and existing object cache services to monitor web traffic by recording how often a client makes a particular request in the object cache and/or other data about the requests. Preferably, the object cache is still used for conventional caching of objects, the object cache thus providing a dual role by storing both web objects and rate accounting data.

Abstract: Provided are techniques for processing window partitioning and ordering for OLAP functions. A prior compare operation is performed by: receiving an input vector for each of one or more attributes of input data that represent one of a partition-by column and an order-by column in a database query; generating a per-attribute comparison vector for each input vector; and producing a single output vector using each per-attribute comparison vector, wherein each value of the single output vector is a Boolean attribute whose value for a given tuple is true if a current value and a most recent prior value of any of the one or more attributes are different.

Abstract: Disclosed is a handwritten contents aggregation device including: an obtaining unit configured to obtain a first file and a second file in each of which written information indicating handwritten contents is added to a same original file; and a processor configured to: analyze the first file and the second file and extract the written information from the first file and the second file, prepare a third file by aggregating the written information extracted from the first file and the written information extracted from the second file in the original file, and output the third file.

Abstract: Methods and apparatus teach a digital spectrum of a file. The digital spectrum is used to map a file's position in a multi-dimensional space. This position relative to another file's position reveals distances between the files. Closest files can be grouped together. When contemplating voluminous numbers of files for digital spectrums, various methods include: concatenating all such files together to get a single key useful for creating a file's spectrum; or compressing files individually and combining their collective dictionaries into a single dictionary with or without the use of tree mechanisms that defines the digital spectrum. Each provides advantage over the other. The latter consumes considerably less run time because each compression event can be distributed to a separate processor. Method two provides better spectrums because it is more “informationally” valid than is method one.

Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.

Abstract: In general, certain embodiments of the present disclosure provide techniques or mechanisms for creating efficient and consistent replication of file overwrites. According to various embodiments, a file map with a sequence file number is created for a data file on a source. The file map includes one or more nodes that each include a sequence node number. When an entry in the file map is changed, the sequence file number is incremented, and the corresponding node is updated by, among other things, setting the sequence node number to equal the current sequence file number. All other nodes in the file map that point to the updated node are similarly updated. When replication occurs, only the updated nodes in the file map are replicated and any unreplicated non-updated nodes are maintained.

Abstract: Techniques herein are for fast processing of path-finding queries in large graph databases. A computer system receives a graph search request to find a set of result paths between one or more source vertices of a graph and one or more target vertices of the graph. The graph comprises vertices connected by edges. During a first pass, the computer system performs one or more breadth-first searches to identify a subset of edges of the graph. The one or more breadth-first searches originate at the one or more source vertices. After the first pass and during a second pass, the computer system performs one or more depth-first searches to identify the set of result paths. The one or more depth-first searches originate at the one or more target vertices. The one or more depth-first searches traverse at most the subset of edges of the graph.

Abstract: A stream of tuples to be processed by a plurality processing elements executing on two or more compute nodes is received. Each compute node stores one or more of the processing elements having one or more stream operators. It is determined whether an overhead parameter associated with a first streams service located at a first stream operator is outside of a first overhead criterion. The first streams service is ended at the first stream operator and a second streams service is instantiated at a second stream operator when the overhead parameter associated with the first streams service is outside of the first overhead criterion. The second stream operator is different from the first stream operator. The method may include determining whether the first streams service samples a first data attribute of tuples or measures performance.

Abstract: Examples of the present disclosure describe systems and methods for using online signals to improve judgment quality in Side-by-Side (SBS) evaluation. In aspects, two or more search result lists may be accessed within a query log. The search result lists may be used to generate and/or determine satisfaction metrics between the search result lists. The satisfaction metrics may be aggregated to automatically generate preference judgments for the search result lists. In some aspects, the preference judgments may be compared to the preference judgments of judges to measure the judgment quality of the judges.

Abstract: An OEM product label may be associated with a plurality of different OEM products; an identity of the manufacturer of the product associated with the label is determined based on the context of the product.

Abstract: An encoding system for encoding an event time series, the system including an inter-arrival time computing device configured to compute an inter-arrival time between a plurality of input events and computes a sequence of events, a transformation device configured to transform the inter-arrival time between the plurality of input events into discrete time symbols, and a mapping device configured to map the input events and the discrete time symbols using a dictionary to output a time gram.

Abstract: A system for outputting an action signal to a controlled system is provided. The system includes a memory storing individuals to be deployed to a production environment as an actor, wherein each of the individuals has a rule associated therewith for asserting an action, and the actor includes one or more individuals, is associated with the controlled system and is configured to transmit an intermediate action signal for asserting the action. The system includes a management server configured to receive the intermediate action signal, select, from a set of available operations, a selected operation to perform with respect to the intermediate action signal, and the set of available operations including allowance and a blocking of the intermediate action signal. Further, in response to the selected operation being the allowance, transmitting the intermediate action signal, and in response to the selected operation being the blocking, blocking the intermediate action signal.

Abstract: A search engine optimization system is provided with an on-line social network system. The on-line social network system includes or is in communication with a search engine optimization (SEO) system that is configured to prioritize keywords (potential search terms) based on their respective predicted contribution to the ranking of JSERPs. The value of a job-related keyword is expressed as a priority score assigned to that keyword. The SEO system generates priority scores for different keywords, using a probabilistic model that takes into account a value expressing how likely the keyword is to be included in a search query as a search term and/or a value expressing how likely is a search that includes the keyword as a search term is to produce relevant results.

Abstract: Provided is a system, a server and a method for managing contents based on location grouping. The location-grouping contents management server includes a location grouping management unit for grouping a geographic location into a plurality of grouped locations according to a location grouping algorithm, a contents upload management unit for setting at least one contents upload access according to the plurality of grouped locations, and distributing and assigning at least one contents upload access to at least one contents uploader according to an access distribution algorithm.

Abstract: An apparatus includes a user interface module that displays a search user interface element to a user. The search element is associated with a multimedia object. An object type module determines type data for the multimedia object indicating an object type of the multimedia object. A query wrapper construction module creates a query wrapper based on the type data. A network communication module transmits the query wrapper to a search system and receives a result set. The result set includes identifying information of a first application state of a first application and a first access mechanism for the first application state. A result presentation module presents the result set to the user. An access module, in response to actuation of a first user interface element, opens the first application to the first application state according to the first access mechanism and provides the multimedia object to the first application state.

Abstract: A computer-implemented method includes inserting a bloom filter creation stage after an inner data source identification stage, wherein a join operation is to be performed to join an outer data source with the inner data source. The method inserts a bloom filter search stage after an outer data source identification stage, wherein each row of data from the outer data source is searched against a bloom filter for the inner data source during the bloom filter search stage. The method initializes a read on the inner data source. Subsequent to determining the bloom filter creation stage is complete, the method initializes a read on the outer data source. The method performs the join operation at a join stage.

Abstract: Compiling test cases. The method may include uploading at least one extract, transform, load job (ETL job) and a plurality of test cases. The method may also include identifying a plurality of design features associated with the at least one uploaded ETL job. The method may further include identifying at least one feature change within the plurality of identified design features. The method may also include determining a plurality of related test cases within the plurality of uploaded test cases corresponding to the at least one identified feature change. The method may further include creating a test bucket based on a grouping of the determined plurality of related test cases. The method may also include adding at least one of a plurality of corresponding ETL jobs and a plurality of corresponding ETL job stages associated with the at least one identified feature change to the created test bucket.

Abstract: A method for testing an extract, transform, load job (ETL job) is provided. The method may include receiving an uploaded ETL job. The method may also include executing a functionality test of the uploaded ETL job using a test bucket. The method may further include determining the executed functionality test produces a failure result. The method may also include creating at least one test sub-job corresponding to at least one stage within on the uploaded ETL job. The method may further include generating a plurality of test data for each of the at least one created test sub-job. The method may also include executing the at least one created test sub-job using the plurality of generated test data. The method may further include creating a report based on a plurality of results associated with the at least one executed test sub-job.

Abstract: A computer-implemented method includes inserting a bloom filter creation stage after an inner data source identification stage, wherein a join operation is to be performed to join an outer data source with the inner data source. The method inserts a bloom filter search stage after an outer data source identification stage, wherein each row of data from the outer data source is searched against a bloom filter for the inner data source during the bloom filter search stage. The method initializes a read on the inner data source. Subsequent to determining the bloom filter creation stage is complete, the method initializes a read on the outer data source. The method performs the join operation at a join stage.

Abstract: Compiling test cases. The method may include uploading at least one extract, transform, load job (ETL job) and a plurality of test cases. The method may also include identifying a plurality of design features associated with the at least one uploaded ETL job. The method may further include identifying at least one feature change within the plurality of identified design features. The method may also include determining a plurality of related test cases within the plurality of uploaded test cases corresponding to the at least one identified feature change. The method may further include creating a test bucket based on a grouping of the determined plurality of related test cases. The method may also include adding at least one of a plurality of corresponding ETL jobs and a plurality of corresponding ETL job stages associated with the at least one identified feature change to the created test bucket.

Abstract: Disclosed are systems, methods, and machine-readable storage media for converting process data extracted from one or more data source systems into a data-source-independent intermediate representation, and then applying a domain-specific semantic ontology to the intermediate representation to create a semantic representation of the process data. The intermediate representation may specify, for each instances of a process object within a process flow, a unique identifier, a set of observations, and references to process-object instance immediately preceding or following the process-object instance at issue.

Abstract: Techniques are described herein for maintaining two copies of the same semi-structured data, where each copy is organized in a different format. One copy is in a first-format that may be convenient for storage, but inefficient for query processing. For example, the first-format may be a textual format that needs to be parsed every time a query needs to access individual data items within a semi-structured object. The database system intelligently loads semi-structured first-format data into volatile memory and, while doing so, converts the semi-structured first-format data to a second-format. Because the data in volatile memory is in the second-format, processing queries against the second-format data both allows disk I/0 to be avoided, and increases the efficiency of the queries themselves. For example, the parsing that may be necessary to run a query against a cached copy of the first-format data is avoided.

Abstract: Techniques for automatically converting data integration (DI) metadata between two different types of DI products are provided. According to one embodiment, a computer system can execute one or more pre-conversion tasks with respect to first DI metadata used by a first DI product, where the one or more pre-conversion tasks including exporting the first DI metadata into an intermediate format. The computer system can then convert, in an automated or semi-automated manner, the first DI metadata from the intermediate format into second DI metadata usable by a second DI product.

Abstract: Orchestrated disaster recovery is provided in which replication volumes are automatically configured as part of a failover procedure. An example method includes obtaining replication volume configuration information identifying configuration of a replication volume in a data replication relationship in which data is replicated from a replication source to a replication target. The replication volume is configured for the replication source and replication volume remains at least partially non-configured for the replication target during data replication from the replication source to the replication target. Based on an indication of failover, the obtained configuration information is used in automatically configuring the replication volume for the replication target in preparation for use by application(s) of the replication target site. Automatically configuring includes configuring, for the replication volume, a volume group and a mount point.

Abstract: Various embodiments for data management in a replicated storage environment, by a processor device, are provided. In one embodiment, a method comprises storing a plurality of data replicas under a plurality of heterogeneous compression algorithms, wherein one of the data replicas is optimized for a data operation.