Abstract: Embodiments of the present invention provide systems and methods for remote query optimization in multi data sources. The method includes receiving a database query from a remote source requesting data-points from multiple data sources. The method further includes receiving and analyzing the data-points, creating a data set based on the analysis, and transmitting the data set to the remote source.

Abstract: A system and method are provided for enforcing user policies on database. In one aspect a user policy and/or enterprise policy is predefined and mapped to the column of the database. Further, the query is run through a query parsing module, the result is sent to a query analyzing module to analyze the sensitivity of each query. A query rewriting module rewrites the query and the rewritten query is sent to the database. A sensitive tree is generated using database metadata, which is used during query analysis and query re-writing. In cases the original query does not contain any set operators the rewritten query is executed on the database and results are displayed as per the user policy. The cases where the original query comprises set operators a function called merger is implemented in the database or at the proxy server and data is displayed as per the user policy.

Abstract: A system for generating a query plan is provided. In some implementations, the system performs operations comprising: translating, into corresponding code, a query operation in a query plan comprising a sequence of query operations; determining a context for the translating of the query operation, the context corresponding to whether the query operation comprises a pre-compiled query operation or a code-generating query operation; and inserting adaptor code between code for the query operation and code for one or more previous query operations in the sequence of query operations, when a change in context is detected between the translating of the query operation and a translation of the one or more previous query operations. Related methods and articles of manufacture are also described.

Abstract: A central relational database management system (RDBMS) is operatively interconnected to one or more back-end database systems. A set of different query criteria specified for each of different types of queries for a mixed query workload is evaluated. At least one remote derived source of data requested by at least one of the different types of queries is dynamically created using at least one of the one or more back-end database systems that supports remote processing of the at least one of the different types of queries.

Abstract: Systems and methods of voice activated thread management in a voice activated data packet based environment are provided. A natural language processor (“NLP”) component can receive and parse data packets comprising a first input audio signal to identify a first request and a first trigger keyword. A direct action application programming interface (“API”) can generate a first action data structure with a parameter defining a first action. The NLP component can receive and parse a second input audio signal to identify a second request and a second trigger keyword, and can generate a second action data structure with a parameter defining a second action. A pooling component can generate the first and second action data structures into a pooled data structure, and can transmit the pooled data structure to a service provider computing device to cause it device to perform an operation defined by the pooled data structure.

Abstract: Disclosed is an approach for improved access of databases using a space-filling curve, such as a z-order curve, and a sparse tree. The space-filling curve traverses every point in n-dimensional space of a multidimensional data structure. The sparse tree can be implemented as a cache to store which rows of the multidimensional data structure have actual data. The sparse tree may have one or more nodes merged into a single node, The sparse tree may have one or more node limits at each node that limit node spawning. Node counters track how many rows containing data not mapped correspond to each node. As the multidimensional data structure is searched, the search path is adjusted by reseeking back to rows that are located in the sparse tree. Further, the search path is adjusted by reseeking back to rows that are located within a query box.

Abstract: A system includes a stored table comprising a plurality of rows and at least one column, each of the plurality of rows associated with a node of a hierarchy, and one of the at least one columns implicity representing a position of a row's associated node within the hierarchy, wherein a Structured Query Language query is received and, response to the query, one or more values of the one of the at least one columns are determined and one or more properties of the hierarchy are determined based on the one or more values.

Abstract: Method and systems for analyzing event log elements are provided. In one example, a method includes receiving an event log element in a computer. A similarity index is calculated between the event log element and a text element. A threshold of similarity is calculated. The similarity index is compared to the threshold. If the similarity index is greater than the threshold, the event log element is grouped into a cluster with the text element to create a file of cluster assignments.

Abstract: An approach for distributed stream computing in non-idempotent output operations is provided. The approach assigns an eventid to a corresponding entityid. The approach determines a minibatchid and a partitionid for a partition. The approach determines whether the partition was previously processed. The approach generates a new minibatchid and a new partitionid for a new partition based upon determining the partition was not previously processed. The approach determines whether a record was previously processed based upon determining the partition was previously processed. The approach processes the record of the partition based upon determining the record was not previously processed.

Abstract: According to one embodiment, a translation component is configured to operate on document encoded data to translate the document encoded data into a canonical format comprising a plurality of canonical types that fold together into a byte stream. The translation component is configured to accept any storage format of data (e.g., column store, row store, LSM tree, etc. and/or data from any storage engine, WIREDTIGER, MMAP, AR tree, Radix tree, etc.) and translate that data into a byte stream to enable efficient comparison. When executing searches and using the translated data to provide comparisons there is necessarily a trade-off based on the cost of translating the data and how much the translated data can be leveraged to increase comparison efficiency.

Abstract: The present inventive concepts encourage users to actively form friend relationships and also incentivize users to actively utilize services provided by an SNS and the like by assigning ranks to users in consideration of the users' friend relationships. A management server including a memory configured to store computer-readable instructions, and one or more processors configured to execute the instructions to determine a personal rank of a target user based on a personal utilization record for the target user, obtain the personal rank of at least one related user who is associated with the target user, and derive an overall rank of the target user based on the personal rank of the at least one related user and the personal rank of the target user may be provided.

Abstract: A computer-implemented method performed at a server system having one or more processors and memory, the method comprising receiving a set of curated documents comprising one or more documents identified as being relevant to a sector, analyzing the set of curated documents to determine one or more words and a count of each of the one or more words for all documents of the curated set of documents, further analyzing the set of curated documents, by analyzing one or more n-grams based on the one or more words, determining a first score based on a term frequency and a global document frequency of each of the one or more words of each of the one or more n-grams, determining a document vector based on averages of the first score, where the document vector comprises a perfect document for the sector, and storing the document vector in the data store.

Abstract: An intelligent tabular big data presentation in search environment based on prior human input configuration is provided. In some examples, a server may execute a search service that may receive a request from a party associated with the data to modify a presentation of a subset of the data and may present configuration options to the requesting party. The configuration options may include a selection of the subset of the data and parameters associated with the presentation of the subset of the data. The selected subset of the data may be formatted based on the received selection of the configuration options. A search query associated with the data may be received and may be executed on the subset of the data. A preview table may be generated and provided based on two dimensionally ranked search results of the subset of the data in accordance with the selection of the parameters.

Abstract: Techniques for presenting a profile card personalized to a member of a social network are described. A first viewer profile can be selected, using member data, from a list of profiles of viewers having viewed a first member profile of a first member, the member data having profile attributes associated with each profile. Additionally, a profile card can be generated for the selected first viewer profile based on the profile attributes associated with the first viewer profile. Moreover, a relevance score for a first highlight associated with the selected first viewer profile can be calculated based on the member data of the first member profile. Furthermore, the profile card can be updated to include the first highlight when the calculated relevance score for the first highlight is higher than a predetermined threshold value. Subsequently, a user interface can cause a presentation of the profile card on a display of a device of the first member.

Abstract: Embodiments for automated data exploration and validation by a processor. One or more optimal data flows are provided in response to a query for one or more heterogeneous data sources according to an inference model based on a knowledge graph of heterogeneous data source relationships, a plurality of data flows between one or more heterogeneous data sources relating to the query, and an ontology of concepts and representing a domain knowledge of the one or more heterogeneous data sources.

Abstract: In one embodiment, a method for presenting an augmented reality effect may include receiving, by a computing system, a request for downloading an augmented reality effect, which may include a plurality of elements. The system may select a first subset of elements among the plurality of elements based on one or more predefined rules. The first subset of elements may be transmitted to the client device for display. The system may transmit a remaining subset of elements of the plurality of elements to the client device for display after the transmitting of the first subset of elements is complete. The augmented reality effect may be configured to launch and display at least one element of the first subset of elements prior to the remaining subset of elements is received by the client device.

Abstract: Embodiments of methods and systems for informatics systems are disclosed. Such informatics systems may utilize a unifying format to represent text to facilitate linking between data from the text and one or more ontologies, and the commensurate ability to mine such data.

Abstract: A storage system is provided, comprising a processor and a storage array comprising a data storage entity storing computer-accessible data and a container executing within the storage array. The container is configured to run a temporal query service configured to query the data storage entity in the storage array from within the storage array, wherein a structure of a temporal query generated in accordance with the temporal query service comprises a query format configured to be compatible with a temporal structure of the data storage entity. The temporal query service is configured to parse at least a first temporal query received from a requesting entity to determine a set of temporal query parameters relating to data stored on the data storage entity, query the data storage entity with a second temporal query formed in accordance with the set of query parameters, and return temporal query results.

Abstract: A method for processing a time series includes dividing, with a processing device, the time series into a plurality of windows by time; extracting at least one group of similar subsequences from a current window among the plurality of windows; and updating a candidate list on the basis of comparison between similar subsequences in each group of the at least one group with k characteristic subsequences in the candidate list; wherein the k characteristic subsequences are k characteristic subsequences with a greatest number of occurrences in at least processed parts of the time series.

Abstract: Disclosed are various embodiments for identifying related collections of items within an item universe. Related collections of items can be identified based upon title similarity or a degree of overlap between collections of items. Additionally, relationships between collections of items can be generated if the collections have identical or nearly identical collection titles.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for storing and accessing data in a cloud system. One of the methods includes receiving an identification of log data that records occurrences of events; receiving a specification of a plurality of different event types to be indexed; indexing the log data according to the specification and group identifiers; receiving a query specifying a reference parameter and requesting one or more predicted events; searching the indexed groups to identify a plurality of groups having events associated with the reference parameter; computing one or more predicted events, from the identified plurality of groups, that are most likely to co-occur in the indexed groups with events associated with the reference parameter; and providing the computed one or more predicted events.

Abstract: Approaches for preserving customizations made to a data management system. Metadata that identifies a mapping between data fields of one or more data source schemas to columns of one or more data tier schemas is maintained. Each of the one or more data tier schemas stores data retrieved from the one or more data source schemas. Values from the metadata are read to dynamically generate software processes. The software processes may update one or more existing ETL processes to reflect an updated state of the one or more data tier schemas and may generate any new ETL processes required to retrieve data stored in the one or more data source schemas and load the retrieved data into the one or more data tier schemas. Customizations made to portions the data management system are preserved in an automated fashion when new versions of system components are deployed.

Abstract: The use of multiple logical data models to expose a data storage system. Each logical data model may expose the data storage system using a semantic mapping set that maps sets of entities or attributes of the respective logical data model to corresponding sets of entities or attributes of the physical data model or perhaps directly to the data storage system itself. Each logical data model might serve a different vertical, and have a particular modelling notation selected by the logical data model provider. The mapping may also translate different logical modelling notations into a common logical modelling notation for use in communicating with the physical data model. The system may account for the lifecycle of the logical data model including birth or retirement of logical data model entities, and merging or splitting of logical data models.

Abstract: A system and method for managing distributed coherent datasets using a hierarchical change log is provided. In some embodiments, a distributed storage system is provided that includes a primary storage device containing a primary dataset and a mirror storage device containing a mirror dataset. The mirror dataset includes a coherent copy of the primary dataset. The distributed storage system further includes a hierarchical change log tracking a coherence state for the mirror dataset. The hierarchical change log includes a first sub-log and a second sub-log, and a block range of the first sub-log overlaps a block range of the second sub-log. The hierarchical change log may define a priority relationship between the first sub-log and the second sub-log governing the overlap. The first sub-log and the second sub-log may be independently configured and may be different in one of a representation and a block size.

Abstract: Aggregating database entry modifications for replay of database changes includes: inserting, in a journal modification table, of database entry modifications, where each database entry is associated with a relative record number; and, for each relative record number: aggregating, in the journal modification table, a plurality of the modifications into a single modification.

Abstract: A system and method can support resettable acknowledgements for synchronizing data between clusters in a distributed data grid. The system can use one or more unique identifiers (IDs) to support message passing between different clusters in the distributed data grid. A first cluster can receive a first replication message from a second cluster, wherein the replication message indicates that the replication message is from a new cluster. Then, the system can reset the first cluster to preserve idempotence in possessing one or more replication messages that are received from the second cluster, following the first replication message.

Abstract: A system for analysis and transaction processing includes an interface and a processor. The interface is configured to receive a task. The processor is configured to determine a processing estimate associated with the task by determining required resources for a set of possible processing solutions to perform the task and to determine a task engine based at least in part on the processing estimate. The task engine comprises an analysis engine or a transaction engine. The analysis engine or the transaction engine is used to process the task. The processor is further to provide the task to the task engine.

Abstract: Systems, methods, and non-transitory computer-readable media can determine at least one content item to be categorized, wherein the content item relates to a topic. The topic related to the content item can be determined. A set of categories can be determined based at least in part on the topic. A determination can be made that the content item corresponds to a first category in the set of categories. The content item can be associated with the first category, wherein the content item is included in a page corresponding to the topic within the first category.

Abstract: A method, apparatus and system for improved community discovery that enables the accurate real-time determination of linkages between groups of individuals in a data-driven manner that is insensitive to noise and/or missing/dropped signals for automatically capturing the dynamic real-time interaction between individuals. No pre-defined parameters are necessary and the operations provide a fully data-driven solution that can be applied and adapted to diverse and highly dynamic environments in real-time in an automated fashion.

Abstract: In a datacenter setting, a summary of differences and similarities between two or more states of the same or similar systems are predicted. Initially, a Long Short-Term Memory (LSTM) neural network is trained with to predict a summary describing the state change between at least two states of the datacenter. Given a set of training data (at least two datacenter states that are annotated with a state change description), the LSTM neural network learns which similarities and differences between the datacenter states correspond to the annotations. Accordingly, given a set of test data comprising at least two states of a datacenter represented by context graphs that indicate a plurality of relationships among a plurality of nodes corresponding to components of a datacenter, the LSTM neural network is able to determine a state change description that summarizes the differences and similarities between the at least two states of the datacenter.

Abstract: Method, system, and computer readable medium for interest tag recommendation are provided in the present disclosure. Statistics about feature words of an Internet article related to an existing interest tag are collected to generate a characteristic vector of the existing interest tag. According to the characteristic vector of the existing interest tag, degree of similarity between the existing interest tag and an interest tag to be recommended is calculated. An interest tag is recommended according to the degree of similarity between the existing interest tag and the interest tag to be recommended.

Abstract: A training query generation system is usable to generate fully formed training questions from prior search queries, some of which may be fully formed search queries and some of which are not fully formed. The system may identify fully formed questions from a query database stored on a storage device. The query database includes a plurality of search query character string, The system further identifies partially formed questions from the query database, creates question templates from the identified fully formed questions, and stores the question templates in a template database. The system then identifies entities with the partially formed questions, classifies each entity, and stores the classified entities in an entity database. Fully formed questions can then be generated using the question templates from the template database and classified entities from the entity database.

Abstract: Described is a system for identifying predictive keywords and generating a forecast. The system receives time-series of keyword counts (the time-series of keyword counts having a plurality of candidate keywords). The time-series of keyword counts are separated (i.e., marked or designated) into a group of time-series from active periods and a group of time-series from inactive periods. A covariance matrix is generated for each group of time-series. Generalized eigenvectors are generated between the two covariance matrices. Candidate keywords are ranked based on the generalized eigenvectors, such that candidate keywords having a rank exceeding a predetermined threshold are designated as predictive keywords. The predictive keywords are then provided to a machine learning system that generates a forecast based on the predictive keywords. Finally, a device is operated based on the forecast.

Abstract: A method by a network node includes generating logically associated clusters of reviews submitted by users regarding an application program executed on user equipments operated by the users, generating a separate summary for each of the clusters of the reviews, and communicating the summaries to a network node.

Abstract: Systems and methods are disclosed for extending and reinforcing a knowledge graph using wiki-like web pages as a source of information. A web crawler parse a wiki-like source and obtain a topic entity from the source. Relationships between the topic entity and sub-topics within the source are identified and a graph is built with the topic and relationships to sub-topics. A candidate topic in the knowledge graph is identified, and a sub-graph of the knowledge graph is either identified or generated. The knowledge sub-graph contains the candidate topic and relationships to sub-topics. A similarity is computed between the source graph and the knowledge sub-graph. If the two graphs are sufficiently similar, then the source topic graph is merged with the knowledge graph.

Abstract: A computing system includes a processor system with at least one processing unit. The processor system is configured to receive image data of a template platform that is associated with fabricating a product. The processor system is configured to obtain barcode data associated with the image data. The processor system is configured to obtain customized data from the image data based on the barcode data. The customized data includes shape data corresponding to a structural attribute of the product. The processor system is configured to obtain template data of the product based on the barcode data. The template data includes product design data. The processor system is configured to provide fabrication data for a digital fabrication system to create the product in accordance with at least the customized data and the product design data. The processor system is configured to transmit the fabrication data to at least one fabrication tool of the digital fabrication system to create the product.

Abstract: The overall architecture and details of a scalable video fingerprinting and identification system that is robust with respect to many classes of video distortions is described. In this system, a fingerprint for a piece of multimedia content is composed of a number of compact signatures, along with traversal hash signatures and associated metadata. Numerical descriptors are generated for features found in a multimedia clip, signatures are generated from these descriptors, and a reference signature database is constructed from these signatures. Query signatures are also generated for a query multimedia clip. These query signatures are searched against the reference database using a fast similarity search procedure, to produce a candidate list of matching signatures. This candidate list is further analyzed to find the most likely reference matches. Signature correlation is performed between the likely reference matches and the query clip to improve detection accuracy.

Abstract: The present disclosure relates to methods for automatically controlling loading processes of dose information images. In one example, the method includes receiving a data record at a local data repository, wherein the data record contains a dose information image and a scanner index. The method further includes: comparing the scanner index against a whitelist from the central data repository; transmitting the data record from the local data repository to a checking directory of the central data repository when the scanner index is not contained in the whitelist; validating the dose information image from the checking directory by character recognition; and entering the scanner index in the whitelist in the event of successful validation of the dose information image.

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: Systems and methods of the present disclosure are directed to analyzing screenshots. A system can include a computing device including a processor coupled to a memory and a display screen configured to display content. The system can include an application stored on the memory and executable by the processor. The application can include a screenshot receiver configured to access, from storage to which a screenshot of the content displayed on the display screen captured using a screenshot function of the computing device is stored, the screenshot including an image and a predetermined marker. The application can include a marker detector configured to detect the predetermined marker included in the screenshot. The application can include a link identifier configured to identify, using the predetermined marker, a link to a resource mapped to the image included in the screenshot, the resource accessible by the computing device via the link.

Abstract: A computer-implemented method of associating digital tags with digital files comprises storing a plurality of digital files having embedded therein content data and metadata including tags; receiving, via a user interface device of a client device, a first tag label containing alphanumeric text created and inputted by a user of the client device; modifying, using a controller device, a selected first one of the tags of the metadata in a first of the digital files to include the first tag label; receiving, via the user interface device or another user interface device, an instruction to search for all of the digital files having at least the first tag label; responsive to receiving the instruction, automatically searching for all of the digital files having at least the first tag label; and displaying, on a video display device associated with the client device, a first indication of the first tag label.

Abstract: Disclosed subject matter relates to digital media including a method and system for generating a contextual audio related to an image. An audio generating system may determine scene-theme and viewer theme of scene in the image. Further, audio files matching scene-objects and the contextual data may be retrieved in real-time and relevant audio files from audio files may be identified based on relationship between scene-theme, scene-objects, viewer theme, contextual data and metadata of audio files. A contribution weightage may be assigned to the relevant and substitute audio files based on contextual data and may be correlated based on contribution weightage, thereby generating the contextual audio related to the image. The present disclosure provides a feature wherein the contextual audio generated for an image may provide a holistic audio effect in accordance with context of the image, thus recreating the audio that might have been present when the image was captured.

Abstract: Techniques for identifying and correcting synchronization errors between audio and subtitles for media content are described herein. For example, a portion of a subtitle file associated with media content may be extracted based on subtitle cues included in the portion of the subtitle file. In embodiments, an audio to text file may be generated from the extracted portion using a speech to text algorithm. A detected subtitle text file may be generated using the subtitle file, the audio to text file, and an edit distance algorithm. In embodiments, one or more synchronization errors between the audio and subtitles for the media content may be identified based on time stamp information associated with the audio to text file and a subtitle cue for the extracted portion of the subtitle file.

Abstract: Methods, systems, and media for providing a media consumption history annotated with social context. In some embodiments, the method comprises: receiving, from a first user device that is associated with a sharing user, a request to share a video item; providing an address associated with the video item; receiving a request, associated with the address, to play the video item; determining, based on the address, that the request to play the video item is associated with the request to share the video item; and causing, via a user interface, a media consumption history to be presented that includes an indication that the video item was shared by the sharing user.

Abstract: Time-series columnar-based information is received and indexed in a compute infrastructure for cost-effective cloud-based object storage. The approach leverages a file format that enables highly-performant search and retrieval of the data stored in the cloud. In operation, an indexer receives the time-series information, indexes that information according to the file format, and forwards the indexed information for storage to the object store, where it is stored as a set of time-based partitions. A partition comprises a set of files, namely, a manifest file, a data file, and an index file. These files are structured as a compact instance of a set of raw unstructured data that comprises the given partition. Highly-performant information retrieval is enabled in response to a time-bounded query, because operations at a query peer (with respect to one or more partitions) are carried out in real-time during query processing and without requiring retrieval of the data file as a whole.

Abstract: Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.

Abstract: Embodiments of the present application relate to a method, a system, and a computer program product for providing recommended terms. A method for providing recommended terms is provided. The method includes determining a search query input by a user and an input time point when the search query was input, determining whether the input time point falls within a time range preset within a current time period, if the input time point falls within the time range preset within the current time period, determining whether the search query is present in a word bank preset for the time range, and if the search query is present in the word bank, providing the user with a special event recommended term preset for the time range.

Abstract: The present teaching relates to generating a conversational agent. In one example, a plurality of input utterances may be received from a developer. A paraphrase model is obtained. The paraphrase model is generated based on machine translation. For each of the plurality of input utterances, one or more paraphrases of the input utterance are generated based on the paraphrase model. For each of the plurality of input utterances, at least one of the one or more paraphrases is selected based on an instruction from the developer to generate selected paraphrases. The conversational agent is generated based on the plurality of input utterances and the selected paraphrases.

Abstract: A semiconductor device that writes, into respective memory spaces of a plurality of separate memories constituting a search memory mat, an entry address corresponding to key data to be written. In this semiconductor device, pieces of divided data are assigned respectively to the separate memories, and, by employing each divided data as an address, entry addresses corresponding to the divided data are written sequentially into memory spaces specified by memory addresses of the separate memories (first writing process). In this first writing process, if another entry address is already written in an accessed memory space, no entry address is written into that memory space. If an entry address corresponding to a single one of the plurality of pieces of divided data is successfully written into a memory space, the first writing process is ended. Second write processing to a verification memory may also be performed. Key data may be written to a backup memory when a whole collision occurs.

Abstract: A method for generating a pattern matching machine for identifying matches of a plurality of symbol patterns in a sequence of input symbols, the method comprising: providing a state machine of states and directed transitions between states corresponding to the plurality of patterns; applying an Aho-Corasick approach to identify mappings between states in the event of a failure, of the state machine in a state and for an input symbol, to transition to a subsequent state based on the directed transitions of the state machine, characterized in that one of the symbol patterns includes a wildcard symbol, and mappings for one or more states representing pattern symbols including the wildcard symbol are based on an input symbol to be received, by the pattern matching machine in use, to constitute the wildcard.