12th week of 2016 patent applcation highlights part 46 |
Patent application number | Title | Published |
20160085762 | Multi-Scene Rich Media Content Rendering System - The present invention provides a system and method for enabling a media-board presentation to facilitate smooth transition of media content from one scene to another without any glitches or interruptions. The system provides a multi-scene rich media content rendering algorithm, wherein the said system performs transition of asset(s) from one scene to another scene by identifying common asset(s) across the scenes and asset(s) common across the scenes are modified according to meta-data relating to the position, size, depth (or layer depth), alpha, volume, aspect and effect with respect to the another scenes, therefore facilitating smooth transition of media content. | 2016-03-24 |
20160085763 | CONTEXTUAL APPLICATION MANAGEMENT - Technologies are presented that optimize application management on a computing device through contextual application archival and retrieval. A method of managing applications may include: learning contextual relevancy of one or more applications installed on a computing device to a user of the device and determining whether an application is no longer contextually relevant to the user. If the application is no longer contextually relevant, the device may send a request to an application management service to obtain and/or maintain the application; create a placeholder for the application at the device; and remove the application from the device. The device may monitor contextual inputs for relevancy of the archived application. If contextual relevancy is determined, the device may send a request to the service to provide the archived application or a replacement of the archived application to the device; receive the requested application; install the requested application; and remove the placeholder. | 2016-03-24 |
20160085764 | SIMPLIFYING INVOCATION OF IMPORT PROCEDURES TO TRANSFER DATA FROM DATA SOURCES TO DATA TARGETS - An aspect of the present disclosure facilitates transferring data from multiple data sources to desired data targets. In one embodiment, meta-data specifying multiple use cases is maintained, with each use case indicating an import procedure and a corresponding condition to be satisfied by a set of import parameters such that the import procedure is executed for importing of data upon satisfaction of the corresponding condition. In response to receiving an import connector requesting transfer of data from data sources to data targets, a use case is selected having the condition which is satisfied by the respective values for the corresponding import parameters received in the import connector. The execution of the import procedure indicated by the selected use case is then initiated to import data from the data sources to the data targets. | 2016-03-24 |
20160085765 | COMPUTING ENVIRONMENT SELECTION TECHNIQUES - A user of a computing device selects a data file and, through an input device, transmits a command to open the selected data file. In response, the computing device launches a location determination application determines, based at least in part on a policy associated with a file type corresponding to the selected data file, that the data file is to be opened in a virtual computing environment. The computing device provides the selected data file to the virtual computing environment along with one or more executable instructions that may cause a server to launch an application within the virtual computing environment capable of opening the selected data file. The user of the computing device, through a virtual computing environment interface installed on the computing device, may access the virtual computing environment to use the selected data file. | 2016-03-24 |
20160085766 | COMPACTING DATA BASED ON DATA CONTENT - An example method for data compaction is disclosed in accordance with an aspect of the present disclosure. The method may include receiving, at a computing device, data files associated with an account. The method may also include determining, by the computing device, whether the account has expired. The method may also include, in response to determining that the account has expired, compacting, by the computing device, the data files associated with the account based on the content of the data files. | 2016-03-24 |
20160085767 | TOPONYM RESOLUTION WITH ONE HUNDRED PERCENT RECALL - Various presentation systems may benefit from appropriate toponym resolution. For example, a system such as a search engine may benefit from toponym resolution with one hundred percent recall. A method can include receiving a set of geographic data comprising recognized toponyms. The method can also include recalling correctly all correctly recognized toponyms of the set. The recalling can include displaying the geographic data on a plurality of related displays. A first display can include at least a subset of the set. A second display can include an overview of the set. | 2016-03-24 |
20160085768 | INFORMATION PROCESSING SYSTEM, AND INFORMATION PROCESSING METHOD - An information processing system includes first and second information processing terminals; and an information processing device that is connected to the first and second information processing terminals. The information processing system includes a receiver for receiving message data and file specifying data for specifying a file that are transmitted from the first and second information processing terminals; a storage unit for classifying the file that is specified by the file specifying data based on access right data representing access rights that are set for users of the first and second information processing terminals and classification data, and for storing the classified file; and a transmitter for transmitting, to the first or second information processing terminal, the message data that is received by the receiver and message data that includes file storage data that represents the file that is stored in the storage unit. | 2016-03-24 |
20160085769 | Synchronization of Shared Folders and Files - A method of synchronizing shared folders and files within a remote and local file system includes determining a remote and local file system state. The remote file system state includes remote hash values for remote instances of shared folders, shared sub-folders, shared files, shared sub-level files, and shared shortcuts. The local file system state includes a local hash values for local instances of shared folders, shared sub-folders, shared files, shared sub-level files, and shared shortcuts. The method also includes comparing the remote file system state and the local file system state to determine any differences in the hash values within the remote file system state and the local file system state and synchronizing any shared folder, shared sub-folder, or shared file having a differing value in the remote file system state and the local file system state across the local file system and the remote file system. | 2016-03-24 |
20160085770 | SYSTEM AND METHOD OF DIGITAL IMAGE MATCHING WITH SUBJECT DESCRIPTORS - This invention is directed to a system for associated digital images with digital image subjects comprising: a personal computing device in wireless communications with a server that, when actuated by a photographer, receives gallery selection input, captures a sync timestamp and receives a plurality of subject descriptor inputs wherein each subject descriptor input has a unique timestamp; a digital camera for capturing a plurality of digital images and a server having computer readable instructions stored in the server for: receiving digital images and the sync timestamp, determining an adjustment factor between the sync timestamp and the timestamp of the sync digital image, adjusting the timestamp of a digital image by the adjustment factor, and associating the digital image with a first subject descriptor when the adjusted timestamp of the digital image falls between the time stamp of a first subject descriptor and a second subject descriptor. | 2016-03-24 |
20160085771 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESING METHOD, AND PROGRAM - There is provided an information processing device comprising an NV memory that is a non-volatile recording medium, a file system unit that manages one or more files stored in the NV memory, and a memory management unit that secures one or more areas of the NV memory that are ready to be used by the file system unit to store a file, and allocates the secured one or more areas to a running process in response to a request from the running process. According to the information processing device, when the NV memory is used both as a main memory and a storage, inconsistencies in the file system caused by an abnormal termination of the system are reduced. | 2016-03-24 |
20160085772 | AUTOMATED CONFIGURATION OF LOG-COORDINATED STORAGE GROUPS - A configuration manager of a storage service receives a set of service requirements, comprising one or more of: a performance requirement for one or more types of storage operations, or an access interface type requirement Based on the service requirements, a candidate storage configuration that includes one or more data store instances and a first log-based transaction manager is generated. Subsequent to an approval of the first storage configuration by a client, the establishment of the data store instances and the log-based transaction manager is initiated. | 2016-03-24 |
20160085773 | GEOLOCATION-BASED PICTOGRAPHS - A system and method for geolocation-based pictographs are provided. In example embodiments, a current geolocation of a user device is determined. A pictograph is identified based on the current geolocation of the user device. The identified pictograph is presented on a user interface of the user device. | 2016-03-24 |
20160085774 | CONTEXT BASED IMAGE SEARCH - A method comprising receiving an image, the image including associated contextual information; converting the received image into searchable image data, the searchable image data being descriptive of the received image; filtering information from a search database based on the contextual information associated with the received image to create a filtered information set; collecting a plurality of images from the filtered information set to create a seed data set; comparing the received image to the plurality of images from the seed data set using the searchable image data; and determining whether one of the plurality of images is related to the received image. | 2016-03-24 |
20160085775 | MANAGING RECORD LOCATION LOOKUP CACHING IN A RELATIONAL DATABASE - In managing a relational database, a relational manager sets a foreign key lookup value to an unavailable state in a source table row containing each of a foreign key value and the foreign key lookup value in a source table in a relational database, wherein the foreign key value references a primary key value in a referenced row in a separate destination table in the relational database. The relational manager, responsive to looking up, for the foreign key value, in a data structure separate from the source table, a location of the referenced row in the relational database, when the foreign key lookup value is set to the unavailable state, updating the foreign key lookup value with the location, wherein the foreign key lookup value in the source table is looked up for identifying the location of the referenced row for subsequent retrievals of the referenced row for the foreign key value. | 2016-03-24 |
20160085776 | REDUCING LOCK OCCURRENCES IN SERVER/DATABASE SYSTEMS - Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS). | 2016-03-24 |
20160085777 | ZERO DOWNTIME MAINTENANCE FOR APPLICATIONS AND DATABASES - Methods, systems, and computer-readable storage media for minimizing downtime during maintenance procedures to an application. In some implementations, actions include executing a first application, executing a second application, and providing an access schema layer that facilitates communication between applications and a data schema layer, the data schema layer including one or more tables of a database, wherein, during a maintenance procedure, the access schema layer includes: a first access schema, the first access schema facilitating exclusive communication between the first application and at least one table of the data schema layer, and a second access schema, the second access schema facilitating exclusive communication between the second application and one or more tables of the data schema layer. | 2016-03-24 |
20160085778 | RECORD SCHEMAS IDENTIFICATION IN NON-RELATIONAL DATABASE - Embodiments include methods and devices for identifying record schemas in a non-relational database by assigning a record to a schema bucket according to structural characteristics of the record and identifying a record schema of the record within the schema bucket so that records with isomorphic record schemas in the non-relational database can be determined. Aspects also include encoding keys of a lowest level of a record according to a global codemap, sorting the keys of the lowest level that belong to different parent keys respectively and updating key names of corresponding parent keys in the parent level of a children level according to the codes of the keys of the children level. | 2016-03-24 |
20160085779 | SYSTEMS AND METHODS FOR DYNAMICALLY INTERCEPTING AND ADJUSTING PERSISTENCE BEHAVIORS VIA RUNTIME CONFIGURATION - The systems and methods described herein relate to dynamic runtime modifications of an object-relational mapping behavior associated with a relational persistence layer. In various embodiments, access to a relational persistence layer, such as a relational database management system may be provided via an object-relational mapper (ORM). The ORM may map data from the relational persistence layer to an object-oriented domain model. The ORM may include a plurality of field mappers configured with an original mapping strategy to map an entity field from the relational persistence layer to the object-oriented domain model. One or more of the field mappers may be configured with a dynamic adjustment strategy that allows the selected field mapper(s) to be injected with a temporary or conditional mapping behavior. The dynamic adjustment strategy may be initialized with the field mapper at startup, while the injection of temporary or conditional mappings may be performed during runtime. | 2016-03-24 |
20160085780 | REFERENCED CONTENT INDEXING - One or more techniques and/or systems are provided for indexing referenced content and/or for deep content searching. In an example, parent content (e.g., an instant message from a friend about a celebrity) may be evaluated to identify a reference (e.g., a URL) to referenced content hosted by a content source (e.g., a photo shared through a photo sharing service). The referenced content may be acquired from the content source, and may be evaluated to identify a search term that is descriptive of the referenced content (e.g., a name of the celebrity in the photo). The parent content and the referenced content may be indexed into a search index using the search term. In an example, responsive to a search query corresponding to the parent content and/or the search term, the parent content and/or the referenced content may be provided as search results. | 2016-03-24 |
20160085781 | TECHNIQUES FOR MAINTAINING COLUMN VECTORS OF RELATIONAL DATA WITHIN VOLATILE MEMORY - Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values. | 2016-03-24 |
20160085782 | UPDATE METHOD AND UPDATING DEVICE - An update method executed by a computer includes: recording a history of processes executed on records in a database in accordance with a request; generating a second index, respectively, for a plurality of new records added to the database in accordance with another request, by applying a storage position to a first index of the plurality of records respectively; and reflecting, to the second index, at least one process from among the processes, the at least one process being executed after a start of the generating of the second index. | 2016-03-24 |
20160085783 | SIMILARITY CALCULATION SYSTEM, METHOD OF CALCULATING SIMILARITY, AND PROGRAM - To calculate quickly a similarity to a query vector even when the number of dimensions of a target vector is large. The similarity calculation system is configured to: acquire a plurality of first target vectors; generate a plurality of second target vectors having a smaller number of dimensions than the plurality of first target vectors by subjecting each of the plurality of first target vectors to predetermined processing; acquire, based on the plurality of second target vectors, a plurality of clusters each including at least one of the plurality of first target vectors and at least one of the plurality of the second target vectors, each of the at least one second target vector corresponding to one of the at least one first target vector; and calculate a similarity between each of the at least one first target vector belonging to one or more clusters selected based on a given query vector having the same number of dimensions as the at least one first target vector, and the given query vector. | 2016-03-24 |
20160085784 | DATABASE DATA TYPE CREATION AND REUSE - Embodiments are provided for creating and reusing custom data types in a database. A selection of a field or group of fields may be received from a database table in the database by a database software application executing on a computer system. Each selected field may include a set of field properties. The application may further receive a user input to initiate saving the selected field or group of fields as a custom data type. In response to receiving the input, the application may be configured to generate a dialog for receiving custom data type information for the selected field or group of fields and save the selected field or group of fields as a custom data type. The custom data type may then be reused by the application in the database. | 2016-03-24 |
20160085785 | CREATING A FILTER FOR FILTERING A LIST OF OBJECTS - Various embodiments of system and methods of creating a filter for a list of objects are described herein. The method includes receiving a selection of a set of objects from the list of objects composed of one or more fields having field values, and comparing the field value in each field of an object with the field values in each of the corresponding fields of the other objects in the set of objects. Based on the comparison, identifying that the field values are the same across the one or more fields of the set of objects. The method further includes generating a list of filter criteria based on the identified field values. The filter may be created using the list of filter criteria. | 2016-03-24 |
20160085786 | TRANSFORMING DATA INTO CONSUMABLE CONTENT - Concepts and technologies are described herein for transforming data into consumable content. In accordance with the concepts and technologies disclosed herein, a computing device can execute a transformation engine for transforming data into the consumable content. The computing device can be configured to analyze the data to identify relationships within data elements or other portions of the data. The computing device also can determine a visualization model to apply to the data and to choose a world based upon the determined visualization model. The computing device can obtain rules associated with the selected or chosen world, and can apply the rules to the data to generate the output. In some embodiments, the computing device can be configured to obtain and apply feedback to the output. | 2016-03-24 |
20160085787 | COMPUTER IMPLEMENTED METHODS AND APPARATUS FOR FEED-BASED CASE MANAGEMENT - Techniques for providing feed-based case management on an online social network. A user interface that includes a publisher and an information feed is provided. Information associated with a record is received and the record is updated in a database system. A feed item associated with the database system update is generated and provided in the information feed. The feed item includes one or more actionable selections providing a reference to the publisher. Selection of one of the one or more actionable selections causes the publisher to be operable to receive further information associated with the record. The record is capable of being updated based on the further information. In some implementations, the record is a case and the user interface serves as a single interface for all interactions required in solving the case. | 2016-03-24 |
20160085788 | REDUCING LOCK OCCURRENCES IN SERVER/DATABASE SYSTEMS - Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS). | 2016-03-24 |
20160085789 | ERROR CHECKING DATABASE RECORDS - An error checking technique for database records. A record is selected and its entities are compared with the entities of other records stored in the database to determine a likelihood that the labels associated with the entities of the selected record are correct. The likelihood for each entity of the selected record being correctly labeled can be determined by comparing the number of times that the entity appears in the database records with that label to the number of times that the entity appears in the database records with any other label. If the likelihood does not exceed a threshold, then an error is likely, and action can be taken to correct the record. | 2016-03-24 |
20160085790 | STRATIFIED SAMPLING OF LOG RECORDS FOR APPROXIMATE FULL-TEXT SEARCH - A log record from a host machine node includes an invariant string and a term. A template identifier is selected, from among template identifiers within a template repository, for a template string matching the invariant string. A sampling count threshold is selected from among a set of sampling count thresholds based on the template identifier and the term. A template-term count is obtained based on a number of earlier log records that were received since the count was reset and have a template identifier and a term that match the template identifier and the term of the log record. Based on the template-term count satisfying the sampling count threshold, an index entry is generated in a sampled log records index based on the log record and the template-term count is reset to a defined value. Based on the template-term count not satisfying the sampling count threshold, the template-term count is incremented. | 2016-03-24 |
20160085791 | TREE COMPARISON TO MANAGE PROGRESSIVE DATA STORE SWITCHOVER WITH ASSURED PERFORMANCE - Technologies are generally provided for progressive key value store switchover by evaluating a maturity of a migrated data store and allowing piecewise switching of substructure area query servicing from an origin data store to a destination data store. In some examples, abstractions of origin and destination tree structures may be compared to each other in order to generate an evaluation metric at substantially reduced performance evaluation load. The evaluation metric may target performance sampling while assuring a desired performance level with localized query servicing switchover. Piecewise data transfer may also be optionally enabled such that overall storage can be similar to the storage of a single data store copy while reducing an impact on existing data store services. | 2016-03-24 |
20160085792 | SYSTEMS AND METHODS FOR LARGE-SCALE SYSTEM LOG ANALYSIS, DEDUPLICATION AND MANAGEMENT - System and methods for parsing raw log data into structured log data, and removing duplicate entries, storing the deduplicated log data into binary format, and managing system events. The subject matter can increase speed of log data analysis and storage, reduce data storage for log data, and easily manage system events. | 2016-03-24 |
20160085793 | MODEL-DRIVEN DATA ENTRY VALIDATION - In various embodiments, methods, systems, and non-transitory computer-readable media are disclosed that allow developers to place client-side validation rules on user interface components using a desktop integration framework. The validation rules can be tied to translatable resources or model metadata. In one aspect, the validation rules metadata is provided separately from the document to which the validation rules will eventually be tied. | 2016-03-24 |
20160085794 | DATA CONSISTENCY AND ROLLBACK FOR CLOUD ANALYTICS - An extract-transform-load (ETL) platform fetches consistent datasets in a batch for a given period of time and provides the ability to rollback that batch. The batch may be fetched for an interval of time, and the ETL platform may fetch new or changed data from different cloud/on-premise applications. It will store this data in the cloud or on-premise to build data history. As the ETL platform fetches new data, the system will not overwrite existing data, but rather will create new versions so that change history is preserved. For any reason, if businesses would like to rollback data, they could rollback to any previous batch. | 2016-03-24 |
20160085795 | GROUPING EQUIVALENT CONTENT ITEMS - Systems and methods for identifying equivalent content items. A computer system may receive a description of a first content item, the description of the first content item comprising a first set of values for a plurality of content item characteristics. The computer system may compare the first content item to each of a plurality of content items. The comparing may comprise, for each combination of the first content item and one of the plurality of content items, identifying any characteristics from the plurality of content item characteristics for which first content item and the one of the plurality of content items has equivalent values. The computer system may identify at least one content item selected from the plurality of content items. The first content item and the at least one content item have equivalent values for a predetermined pattern of the plurality of content item characteristics. The computer system may write to the memory an indication of a group of equivalent content items comprising the first content item and the identified at least one content item. | 2016-03-24 |
20160085796 | SWAT COMMAND AND API FOR ATOMIC SWAP AND TRIM OF LOGICAL PAGES - Example embodiments provide access to an updated file performed by at least one processor, wherein responsive to receiving a first list of logical page numbers (LPNs) and a second list of LPNs for an update, wherein the first list of LPNs is mapped to a first list of physical page numbers (PPNs), and the second list of LPNs is mapped to a second list of PPNs, the method, comprising: atomically remapping the first list of LPNs so that the first list of LPNs is mapped to the second list of PPNs; and trimming a mapping of the first list of LPNs to the first list of PPNs. | 2016-03-24 |
20160085797 | ARCHIVAL DATA IDENTIFICATION - A request to retrieve a persistently stored data object is received, the request including a data object identifier that encodes at least storage location information and validation information related to the data object. The data object is retrieved using at least the storage location information to form a retrieved data object, and validation is performed using at least the validation information. | 2016-03-24 |
20160085798 | METHOD AND SYSTEM FOR STORING USER INFORMATION - According to an embodiment, in a first storing system, a record corresponding to an account number ID is stored. In the record, a primary key is the account number ID, and a value is an account number mode and an account number name of the account number. The second storing system obtains the account number and the account number ID from the first storing system, determines whether the account number satisfies the preset reverse-searching condition. If yes, the second storing system generates and stores a record. In the record, a primary key is the account number mode and the account number name of the account number, and a value is the account number ID. | 2016-03-24 |
20160085799 | METHOD AND SYSTEM FOR CORRECTING ERROR OF KNOWLEDGE INVOLVED QUERY - Provided is a method and system for correcting a knowledge error in a search query. A method of correcting a knowledge error in a search query may include generating a recommended search query for a plurality of domains by combining at least one search term from each of a plurality of vocabulary sets, each of the plurality of vocabulary sets associated with a respective domain, verifying the recommended search query based on a reliability factor of the recommended search query, and generating, for each domain, a knowledge error correction rule for correcting a knowledge error indicating an error of a concept or information, with respect to the verified recommended search query. | 2016-03-24 |
20160085800 | SYSTEMS AND METHODS FOR IDENTIFYING AN INTENT OF A USER QUERY - Systems and methods are described herein for identifying an intent of a user query. A media guidance application may receive a query from a user using any suitable method, including text input and voice/speech recognition software. The media guidance application may extract a plurality of n-grams from the query. The media guidance application may calculate, for each of the plurality of n-grams, a mutual information value with each of a plurality of potential intents. The mutual information value may indicate a measure of dependence between one of the plurality of n-grams and one of the plurality of potential intents. The media guidance application may select a subset of the plurality of n-grams based on the calculated mutual information values and input the subset of the plurality of n-grams into a probabilistic classifier, such as a Naïve Bayes Classifier, in order to identify the intent of the query. | 2016-03-24 |
20160085801 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR UPDATING DATABASE OBJECTS WITH REPORT AGGREGATIONS - In accordance with embodiments, there are provided mechanisms and methods for updating database objects with report aggregations. These mechanisms and methods for updating database objects with report aggregations can enable high-level configurations defining the use of report aggregations in specified database objects. This can allow user-friendly configurations of data aggregations and uses thereof, efficient generation of reports having data aggregations, and/or aggregations that are not limited based on user access privileges but that summarize all desired data. | 2016-03-24 |
20160085802 | Contextual Inference of Non-Verbal Expressions - Contextual awareness is used to reveal non-verbal expressions. A current context of a device is evaluated to infer a user's body posture and emotional state. The user's body posture and emotional state may then be used for improved services and targeted advertising. | 2016-03-24 |
20160085803 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085804 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085805 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085806 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085807 | Deriving a Multi-Pass Matching Algorithm for Data De-Duplication - Methods, systems, and computer program products for deriving a multi-pass matching algorithm for data de-duplication are provided herein. A method includes identifying multiple passes across multiple databases using a set of one or more blocking columns derived from a set of trained input data; identifying, in each of the multiple passes, one or more columns across the multiple databases that match one or more of the blocking columns; selecting a given pass from the multiple passes, wherein said given pass comprises a maximum number of matching columns within the multiple passes; determining, for the given pass, data that conform to the given pass comprising (i) a set of matching columns, (ii) one or more matching types and (iii) one or more weights; and determining one or more subsequent passes across the multiple databases iteratively by removing the data that conform to the given pass. | 2016-03-24 |
20160085808 | UPLOADING EXTERNAL FILES AND ASSOCIATING THEM WITH EXISTING DATA MODELS - A computer-implemented method includes providing a fixed portion of a data model, uploading external files to an extended portion of the data model, matching at least some parts of the external files to the fixed portions of the data model, and using data from both the fixed and extended portions of the data model together. A computer-implemented method includes receiving a query from a user to a data model that includes a stored subject area portion and a stored extended subject area portion, accessing at least one storage to retrieve the subject area portion and the extended subject area portion, joining relevant portions of the subject area and extended subject area, extracting answers to the query from the joined portions, and reporting the answers to the user. | 2016-03-24 |
20160085809 | ENRICHING EVENTS WITH DYNAMICALLY TYPED BIG DATA FOR EVENT PROCESSING - Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected. | 2016-03-24 |
20160085810 | SCALING EVENT PROCESSING USING DISTRIBUTED FLOWS AND MAP-REDUCE OPERATIONS - Some event ordering requirements can be determined based on continuous event processing queries. Other event ordering requirements can be determined based on distribution flow types being used to distribute events from event streams to node executing the queries. Events from event streams can be ordered according to ordering semantics that are based on a combination of all of these event ordering requirements. Additionally, virtual computing nodes can be associated with constraints, and computing processors can be associated with capabilities. Virtual computing nodes for processing event streams can be assigned to execute on various computing processors based on both these constraints and capabilities. Additionally, for each of several events in an event stream, a ratio between a total latency and a communication latency can be for determined. Based on an average of these ratios, a quantity of reducing nodes that will be involved in a map-reduce operation can be selected. | 2016-03-24 |
20160085811 | GENERATING A FEATURE SET - A technique to generate a feature set. A plurality of samples from a data set can be clustered. Features can be selected based on the clusters. The features can be added to the feature set. Additional samples can be clustered and features selected and added to the feature set until a convergence threshold is reached. | 2016-03-24 |
20160085812 | METHOD OF MANAGING CONTENT IN ELECTRONIC APPARATUS AND ELECTRONIC APPARATUS CONTROLLED ACCORDING TO THE METHOD - A method of managing content and an apparatus implementing the method are presented. The method of managing content includes obtaining content by an electronic apparatus; and executing an operation corresponding to a category related to the obtained content. The method of managing content enables an easy management of content obtained, by using the electronic apparatus, capable of obtaining content, which may conveniently manage content by automatic execution of an operation without direct executing an operation related to each of content by a user of the electronic apparatus. | 2016-03-24 |
20160085813 | DYNAMIC MODIFICATIONS OF RESULTS FOR SEARCH INTERFACES - The present disclosure is directed to apparatuses, systems, and methods for enhancing search results based on recent user interactions. As described herein, embodiments may infer various refinements for search queries; these refinements are based, at least in part, on the user's recent interactions with the search platform (e.g., within a current session). In other words, as the user is interacting with the search platform, one or more refinements may be inferred to help make the search results more relevant to the user. | 2016-03-24 |
20160085814 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - Provided is an information processing apparatus including a control section that provides, to a terminal of a user, a relationship among a plurality of keywords each as an element constituting a facet that is used as an index for searching for a content, as a facet map, and a facet selection environment that is based on at least one keyword addable to the facet map as a new element of the facet, calculates a usage frequency of each of the keywords in the terminal, and adds a keyword whose calculated usage frequency satisfies a predetermined condition to the facet map as the new element of the facet. | 2016-03-24 |
20160085815 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND STORAGE MEDIUM - An information processing apparatus according to an embodiment includes an information acquisition unit, a user information extraction unit, and a grouping processing unit. The information acquisition unit acquires information on an identification target provided in a place corresponding to a business operator from a user terminal that detects the information on the identification target. The user information extraction unit, when the information on the identification target is acquired by the information acquisition unit, extracts from the business operator information database user information corresponding to the user terminal among pieces of user information of the business operator corresponding to the place in which the identification target is provided. The grouping processing unit assigns the user terminal to one or more groups based on the user information extracted by the user information extraction unit. | 2016-03-24 |
20160085816 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING SYSTEM, INFORMATION PROCESSING METHOD, AND RECORDING MEDIUM - According to one embodiment, an information processing apparatus includes a preference information obtainer that obtains preference information indicating preferences of a target user to which recommendation is to be made, the preferences ranging over a plurality of genres. The information processing apparatus includes a recommendation item determiner that determines, using the preference information of the target user and recommendation candidate information about a plurality of recommendation candidates ranging over a plurality of genres, a recommendation item to be recommended to the target user from the plurality of recommendation candidates, the recommendation candidate information being stored in an accessible storage apparatus. | 2016-03-24 |
20160085817 | SYSTEM AND METHOD FOR INVESTIGATING LARGE AMOUNTS OF DATA - A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis. | 2016-03-24 |
20160085818 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085819 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085820 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085821 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085822 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085823 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085824 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085825 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085826 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085827 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 2016-03-24 |
20160085828 | JUST-IN-TIME COMPUTATION IN A FEDERATED SYSTEM - An example method for processing a federated query includes determining, at a data federation tool, a source query embedded in a federated query. The source query includes a name of a table and one or more conditions for selecting data from the table. The method also includes sending, at the data federation tool, a request to compile a software package in accordance with a view description of the table to a data slave. The software package includes a set of source files and is associated with the table. The method further includes sending the source query to the data slave and receiving, at the data federation tool, the result of the source query from the data slave. | 2016-03-24 |
20160085829 | QUERY METHOD FOR A DISTRIBUTED DATABASE SYSTEM AND QUERY APPARATUS - A method, system, and/or computer program product queries a distributed database system. In one embodiment, the query method comprises: parsing a query request; generating an access plan for the query request, wherein the access plan specifies therein a database table related to the query request, and the database table has a plurality of copies stored in different database devices respectively; selecting, based on status information of each of the plurality of copies of the specified database table, one copy from the plurality of copies as a target database table; and executing a query operation in the target database table according to the access plan. | 2016-03-24 |
20160085830 | REPUTATION-BASED DISCOVERY OF CONTENT OBJECTS - A content-discovery system allows a node in a Content Centric Networks (CCN) to discover content over CCN. The CCN node can generate an Interest that includes a query for discovering content associated with a given name prefix, and after disseminating the Interest over CCN, can receive a query-result Content Object that includes a listing of matching Content Objects and their reputation information. The CCN node can also process Interests issued by other CCN nodes that would like to discover content. After receiving an Interest comprising a query for discovering content, the CCN node searches a repository for a set of Content Objects that match the query. The CCN node generates a results list that includes the Content Object in the search results and their reputation information. The CCN node then generates and returns a query-result Content Object that includes the Interest's name, and whose payload includes the results list. | 2016-03-24 |
20160085831 | METHOD AND APPARATUS FOR MAP CLASSIFICATION AND RESTRUCTURING - Method, device, computer program product, and apparatus for performing map classification is described. An unstructured map can be received to determine groups of components within the unstructured map having a same property. Shared properties within the unstructured map can include color, intensity, contrast, and line connectivity. A structured map can be generated by assigning each group of components detected within the unstructured map to a layer. A visual representation of the groups may be presented or displayed within a graphical user interface (GUI), such that each group is a selectable object for manipulation within the GUI. The GUI can receive selections or requests to update one or more properties of the group. | 2016-03-24 |
20160085832 | System and method of analyzing data using bitmap techniques - A method and system of analyzing data using bitmap techniques by first transforming source data records to key-value pairs, then selecting required attributes within said data source to create bitmap segments that are associated to the attribute's corresponding data records, where data analyses are performed by mean of formulating and executing required Set (or bit-wise) operations among the required bitmap segments to generate a final result bitmap segment, and based on which retrieving the corresponding result set of data records and perform further analyses by applying statistical and/or user-defined functions on the result set to generate the required result. | 2016-03-24 |
20160085833 | TARGETED MULTI-DIMENSION DATA EXTRACTION FOR REAL-TIME ANALYSIS - Methods and systems for extracting targeted data for real-time reporting are discussed. In an example, a system can include a data store, a server, and a denormalized database. The data store can maintain data created by an application. The server can be communicatively coupled to the data store. The server can include a data extraction module and a data compression module. The data extraction module can extract a subset of the data stored in the data store according to an extraction scheme. The data compression module can compress the extracted subset of the data into a set of aggregated key value pairs. The denormalized database can store the aggregated key value pairs. | 2016-03-24 |
20160085834 | PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS - To prioritize repopulation of in-memory compression units (IMCU), a database server compresses, into an IMCU, a plurality of data units from a database table. In response to changes to any of the plurality of data units within the database table, the database server performs the steps of: (a) invalidating corresponding data units in the IMCU; (b) incrementing an invalidity counter of the IMCU that reflects how many data units within the IMCU have been invalidated; (c) receiving a data request that targets one or more of the plurality of data units of the database table; (d) in response to receiving the data request, incrementing an access counter of the IMCU; and (e) determining a priority for repopulating the IMCU based, at least in part, on the invalidity counter and the access counter. | 2016-03-24 |
20160085835 | VISUALIZATION SUGGESTION APPLICATION PROGRAMMING INTERFACE - A dataset and some user selected columns of the dataset are received by a statistical analysis module for analysis. The statistical analysis module generates a score for each unselected column of the dataset based on statistical analysis of the unselected columns and all or a subset of the selected columns. A ranking of the unselected columns is presented to the user for selection of one additional column of the dataset, after which the remaining unselected columns are re-ranked according to their associated scores and once again displayed to the user. The user may continue selecting from among the ranked columns until a threshold number of columns has been selected, at which point the user may deselect a selected column in order to continue selecting additional columns. A visualization suggestion application program interface then matches the selected columns with compatible visualization configurations and presents some of these visualizations to the user. | 2016-03-24 |
20160085836 | SYSTEM FOR ACHIEVING NON-INTERRUPTIVE DATA RECONSTRUCTION - A system for achieving non-interruptive data reconstruction is disclosed. The system includes a source storage, a target storage, a server, a traffic modeling unit and at least one data moving service unit. With the help of traffic modeling unit, a period of time of low access can be estimated. Data reconstruction (copying or moving) can be carried on during the period of time. Thus, non-interruptive data reconstruction can be done. | 2016-03-24 |
20160085837 | SNAPSHOT AND REPLICATION OF A MULTI-STREAM APPLICATION ON MULTIPLE HOSTS AT NEAR-SYNC FREQUENCY - Storage access requests are received from one or more applications. Multiple servers update multiple virtual disks as directed by the storage access requests. The virtual disks store data that is write order dependent across the virtual disks. Logs are associated with the virtual disks. Information associated with each storage access request is stored in one of the logs. A cycle of log switching is performed. A write order consistent tracking coordinator coordinates the log switching with agents at the servers to maintain request ordering. Replication coordinators coordinate the application of the switched-out log files from primary storage to replica storage, creating a write-order consistent point on the replica side matching the primary side, and providing for failure resiliency regarding transfer of the logs. The replication logs may be received individually on the replica side from the servers on the primary side to enable highly scalable parallel/simultaneous transfers of the logs. | 2016-03-24 |
20160085838 | METHOD AND SYSTEM FOR DOCUMENT SYNCHRONIZATION IN A DISTRIBUTED SERVER-CLIENT ENVIRONMENT - A method and system for synchronizing documents in a distributed server-client environment. The system includes a synchronization server, a distributor client, a user client, and/or a network connecting the server and the clients. The method includes the steps of wrapping synchronization information such as document ID and version number in a synchronized document, storing the synchronized document and the synchronization information in a synchronization server, and comparing the local version with the version stored in the sync server if a latest version is to open, and if the local version is not the latest version, accessing the latest version document by receiving the document from the synchronized server. | 2016-03-24 |
20160085839 | Computer Implemented Method for Dynamic Sharding - The present disclosure relates to systems and methods for dynamic sharding of a database comprising data identifiable by keys comprised within a global ordered range. When handling a request for data of at least one key: providing the request to a predetermined shard store; the predetermined shard store verifying, by means of its local subrange collection, whether the at least one key is present in a local subrange of a shard stored on the predetermined shard store; and when at least one key is not present in a local subrange of a shard stored on the predetermined shard store, returning a message comprising the local subrange collection of the predetermined shard store. | 2016-03-24 |
20160085840 | Universal Interaction for Capturing Content to Persistent Storage - Systems and methods for enhanced content capture on a computing device are presented. In operation, a user interaction is detected on a computing device with the intent to capture content to a content store associated with the computer user operating the computing device. A content capture service is executed to capture content to the content store, comprising the following: applications executing on the computing device are notified to suspend output to display views corresponding to the applications; content to be captured to the content store is identified and obtained; the applications executing on the computing device are notified to resume output to display views; and automatically storing the obtained content in a content store associated with the computer user. | 2016-03-24 |
20160085841 | Dynamic Application Containers - Managing application interaction on a device using dynamic containers. A method includes, for a set of applications on a device, based on certain conditions, determining a plurality of container groups. Each container group defines a set of applications and a set of interactions parameters defining boundaries of interactions between the applications for the applications in the container group. The method further includes identifying one or more changes in the certain conditions. As a result of identifying one or more changes in the certain conditions, the method includes changing membership in the container groups. | 2016-03-24 |
20160085842 | SYSTEM AND METHOD FOR AVOIDING OBJECT IDENTIFIER COLLISIONS IN A PEERED CLUSTER ENVIRONMENT - A system and method for avoiding object identifier collisions in a cluster environment is provided. Upon creation of the cluster, volume location databases negotiate ranges for data set identifiers (DSIDs) between a first site and a second site of the cluster. Any pre-existing objects are remapped into an object identifier range associated with the particular site hosting the object. | 2016-03-24 |
20160085843 | PERSPECTIVE DATA ANALYSIS AND MANAGEMENT - A system and computer-implemented method for managing perspective data is disclosed. The method may include identifying a variant feature of an item having a first set of perspective data. The method may include grouping, based on the variant feature, the first set of perspective data into a first group and a second group. The method may include determining a first set of relevancy scores for the first group and a second set of relevancy scores for the second group. The method may also include establishing, using at least one of the first and second relevancy scores, a second set of perspective data configured to include a subset of the first set of perspective data. | 2016-03-24 |
20160085844 | TAG ADDING APPARATUS AND TAG ADDING METHOD - According to one embodiment, a tag adding apparatus includes the following units. The input unit inputs an input tag added to an input content item. The storage unit stores registered content items in association with registered tags. The search unit retrieves a first and a second content aggregate from the storage unit. The analyzer analyzes the number of content items of the first content aggregate, and to analyze an inclusion relationship between the first and the second content aggregate. The determination unit determines an additional tag to be additionally added to the input content item based on a result of analysis. The registration unit registers the input content item in the storage unit in association with the input tag and the additional tag. | 2016-03-24 |
20160085845 | SERVER APPARATUS, DATA AGGREGATION METHOD, AND COMMUNICATION DEVICE - According to an embodiment, a server apparatus includes: a processor configured to perform: receiving a group ID and a plurality of calculation data corresponding to the group ID from a communication device; registering the plurality of received calculation data correlated with the received group ID; and transmitting image data acquired by aggregating the plurality of registered calculation data for the group ID. | 2016-03-24 |
20160085846 | SYSTEM FOR FACILITATING THE COLLABORATIVE CREATION OF MUSIC - The system comprises a taxonomy for classifying a music recording and can further comprise a computing functionality. The functionality can: provide for the dissemination of identities of recordings that have been classified in accordance with the taxonomy and the classifications thereof; allow users to identify recordings that have been classified in accordance with the taxonomy; allow user to classify recordings in accordance with the taxonomy; permit users to identify music projects and to associate music recordings to projects; in respect of projects to which recordings have been associated having differing proprietors, provide a mechanism by which those proprietors can submit votes on a division of rights in a Master defined by those recordings; provide for dissemination of the recordings and the classifications by a scatterplot graph wherein each point represents a music recording, each of the dimensions of the plot being associated with a relatively highly-variable characteristic of the recording. | 2016-03-24 |
20160085847 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM FOR THE SAME - An information processing device includes: a storage unit; a first display control unit; and a demanding unit. The storage unit that stores attribute data representing specified attribute of contents and category data representing a category of the attribute correlated to each other. The first display control unit that provides controls for displaying information for a selected attribute and for displaying, in a categorized state, information for related attributes correlated to the same category as that of the attribute on a correlation display screen. The demanding unit that demands data search by referring to the correlated attribute selected corresponding to information selected from among those displayed on the correlation display screen to an information provision device. | 2016-03-24 |
20160085848 | CONTENT CLASSIFICATION - Techniques for determining classifications from content of data objects ( | 2016-03-24 |
20160085849 | Computer-Implemented System And Method For Generating Clusters For Placement Into A Display - A computer-implemented system and method for generating clusters for placement into a display is provided. A set of clusters is generated from a document set. A single cluster of related documents from the document set is obtained and at least one new cluster is added. One such document in the set is compared to the cluster. A difference in distance between the document and a common origin and the cluster and the common origin is determined. The document is designated as the new cluster when the difference fails to satisfy a predetermined threshold. One or more cluster spines each having two or more clusters placed along a vector are placed into a display. The clusters along each spine are identified as similar and the clusters of one such spine are also similar to further clusters located along a further spine having a small cosine rotation from that cluster spine. | 2016-03-24 |
20160085850 | KNOWLEDGE BROKERING AND KNOWLEDGE CAMPAIGNS - Knowledge automation techniques may include receiving a description of a knowledge campaign, and selecting knowledge elements from a data store based on the description of the knowledge campaign. The selected knowledge elements can be compiled into the knowledge campaign, and the knowledge campaign can be provided to target users. The consumption progress of the knowledge campaign by the target users can be monitored. | 2016-03-24 |
20160085851 | GUIDED DATA EXPLORATION - A system for exploring data receives the data from a database and indexes the data in a server. The system displays one or more selectable datasets from the indexed data, where the selected dataset includes one or more attributes. The system then sorts the one or more attributes by level of interestingness and displays the sorted attributes. | 2016-03-24 |
20160085852 | SUPPLEMENTING STRUCTURED INFORMATION ABOUT ENTITIES WITH INFORMATION FROM UNSTRUCTURED DATA SOURCES - A method for supplementing structured information within a data system for entities based on unstructured data analyzes a document with unstructured data and extracts attribute values from the unstructured data for one or more entities of the data system. Entity records with structured information are retrieved from the data system based on the extracted attribute values. Entity references for corresponding entities of the data system are constructed based on a comparison of the retrieved entity records and the extracted attribute values. The entity references are linked to the corresponding entities within the data system, with the entity references including extracted attributes from the unstructured data for corresponding linked entities. | 2016-03-24 |
20160085853 | SEMANTIC TEXT SEARCH - A system for performing semantic search receives an electronic text corpus and separates the text corpus into a plurality of sentences. The system parses and converts each sentence into a sentence tree. The system receives a search query and matches the search query with one or more of the sentence trees. | 2016-03-24 |
20160085854 | Dynamic Natural Language Conversation - Technologies are described herein for providing dynamic natural language interactions between a user and a computing device. In one aspect, a computing device managing a conversation with a user is enhanced with the identification and management of one or more topics. Using techniques described herein, the computing device can focus on one or more topics, shift between topics and/or introduce new topics. Techniques disclosed herein may also manage and process interruptions that may be introduced during a conversation. Dynamic access of contextual information may assist in the generation of contextually-relevant statements, and the contextual information may be used to balance priorities between various topics. Each topic may also have an associated decay rate so that the lifespan of individual topics may track realistic scenarios. In addition, the priorities of individual topics may be dynamically adjusted so topics may track events created by a user and a computing device. | 2016-03-24 |
20160085855 | PERSPECTIVE DATA ANALYSIS AND MANAGEMENT - A system and computer implemented method for managing perspective data is disclosed. The method may include collecting a first lot of perspective data for an item. The method may include introducing a variant feature to the item to constitute a modified item. The method may include collecting a second lot of perspective data for the modified item. The method may also include evaluating the first and second lots of perspective data to ascertain a sentiment fluctuation based on information relevant to the variant feature. | 2016-03-24 |
20160085856 | GENERATION OF SUPPORT DATA RECORDS USING NATURAL LANGUAGE PROCESSING - A view generator receives support text characterizing a support requirement for available information technology (IT) support, the support text being received in sentence form via a graphical user interface (GUI). A text analyzer performs natural language processing on the support text and thereby identifies at least one sentence part and at least one named entity within the support text. A support record generator relates each of the at least one sentence part and the at least one named entity to a support record type, and generates a support data record for the support requirement, including filling individual fields of the support data record using the at least one sentence part and the at least one named entity. | 2016-03-24 |
20160085857 | GROUPING DATA USING DYNAMIC THRESHOLDS - A plurality of confidence values is classified into one of a plurality of classes in accordance with a first criterion that was defined prior to the plurality of confidence values being received. The plurality of confidence values represents confidence of answers to a query submitted to an answering system. A second set of one or more thresholds based, at least in part, on the plurality of confidence values is determined. Unclassified ones of the plurality of confidence values are classified into one of the plurality of classes based, at least in part, on a number of the plurality of classes and the second set of one or more thresholds. The answers represented by the plurality of confidence values are presented in accordance with the classification of the plurality of confidence values into the plurality of classes. | 2016-03-24 |
20160085858 | AUTOMATED DETECTION AND FILTERING OF AUDIO ADVERTISEMENTS - Apparatuses, systems, methods, and media for filtering a data stream are provided. The data stream is analyzed based on an acoustic parameter to determine extraneous portions in which a first predetermined condition is satisfied. When a first extraneous portion is separated from a second extraneous portion by a non-extraneous portion in which the first predetermined condition is not satisfied, it is determined whether the first extraneous portion being separated from the second extraneous portion by the non-extraneous portion satisfies a second predetermined condition. At least one of the first extraneous portion and the second extraneous portion is deleted from the data stream to produce a filtered data stream in response to determining the second predetermined condition is satisfied. | 2016-03-24 |
20160085859 | ANALYTIC COMPARISON OF LIBRARIES AND PLAYLISTS - Digital goods libraries are compared via their datasets, which include organizational data and history data. Potential comparison results include a shared multiple natural languages presence, shared genre frequency change, shared artist frequency change, shared digital good frequency change, shared outlier presence, shared similar songs presence, and/or shared recommendable goods presence. Proper subsets of datasets may be specified by playlist, genre, artist, category, date, play frequency, and/or play count, and then compared. Comparison results may be visualized, such as playlist content over time, play frequency over time, and/or play count over time. Some results include printed or spoken text such as an artist name, genre name, and/or review content. Control over disclosure of library owner identity is provided. In some cases a dataset is compared with multiple datasets in a group, e.g., to help assess compatibility between a prospective member and current members of the group. | 2016-03-24 |
20160085860 | SEARCH ENGINE FOR TEXTUAL CONTENT AND NON-TEXTUAL CONTENT - A search engine system that can match a search request to not only a specific content item (e.g., video file), but also to a single component of a content item. For instance, using a video content item as an example, the search engine system can match a specific search request to not only a specific video within a collection of videos, but also to a single moment within a video, a video segment, and a group of videos. | 2016-03-24 |
20160085861 | PRIVATE CLOUD API - Methods, systems, and computer program for implementing a private cloud are provided. A computer-implemented method may include registering a private cloud in a central registry; retrieving private cloud registration data from the central registry; sharing the private cloud registration data with other users; and allowing other users to connect to the private cloud using the shared private cloud registration data. | 2016-03-24 |