Abstract: Embodiments of the present invention provide a method, system and computer program product for partnership relationship management (PRM) data synchronization in a customer relationship management (CRM) data processing system. In an embodiment of the invention, a method for PRM data synchronization in a CRM data processing system can include receiving a data synchronization request from one of several different CRM systems over a computer communications network. The method additionally can include identifying the one different CRM system from amongst the different CRM systems and locating a mapping of data fields corresponding to the identified CRM system. Finally, the method can include synchronizing data received from the identified one of the different CRM systems data with data in the CRM data processing system that maps to the received data according to the located mapping of data fields.

Abstract: An example method to adjust demographic data involves generating a first model based on reference demographic data corresponding to panelists and based on first self-reported demographic data and behavioral data from a database proprietor. The first self-reported demographic data and the behavioral data correspond to ones of the panelists having user accounts with the database proprietor. The first self-reported demographic data is provided to the database proprietor by the ones of the panelists having the user accounts with the database proprietor. The first model is used to partition the first self-reported demographic data into nodes, each node representing a respective subset of the first self-reported demographic data. At least some of the first self-reported demographic data is redistributed between at least some of the nodes to generate a second model that is to facilitate correcting at least one of inaccuracies or misrepresentations in the second self-reported demographic data.

Abstract: A method of analysis and presentation of court document information includes: at least one of one or more servers providing, to a user, a user interface, the user interface permitting assignment, for each court ruling associated with a court document stored in a searchable database, of one or more of pre-defined categories relating to the ruling, the one or more pre-defined categories including at least one of: (a) a type of procedural vehicle that led to the ruling; (b) a description of the procedural vehicle that led to the ruling; and (c) the court's ruling; and at least one of the one or more servers arranging the categorized court rulings in the searchable database, such that the court documents can be searched on the basis of at least one or more of the assigned pre-defined categories.

Abstract: A media content playlist generation and access system for a video entertainment network is herein disclosed whereby a plurality of media content emanating from various disparate networks may be conglomerated into a customized list. The list may contain stored media content, which are customarily stored in the head end portion of a CATV network, media content accessible via the Internet, or yet to be aired media content. The system also provides for manipulation of the playlist from various consumer electronic display devices that are interconnected to the Internet, or the PSTN, thereby allowing further customization of the playlist at the user's convenience. Additionally, a multiple user account system is provided wherein multiple user accounts may be configured in order to allow a corresponding multiple individualized playlists, which are each customized to suit each user's tastes.

Abstract: Methods and systems for generating influence scores are disclosed. A plurality of opinions of a selected topic are retrieved from a database. Influencers each associated with at least one opinion from the plurality of opinions are determined using the processor. A score is automatically generated for each influencer using the processor, the score related to the selected topic.

Abstract: A data normalization system is described herein that represents multiple data types that are common within database systems in a normalized form that can be processed uniformly to achieve faster processing of data on superscalar CPU architectures. The data normalization system includes changes to internal data representations of a database system as well as functional processing changes that leverage normalized internal data representations for a high density of independently executable CPU instructions. Because most data in a database is small, a majority of data can be represented by the normalized format. Thus, the data normalization system allows for fast superscalar processing in a database system in a variety of common cases, while maintaining compatibility with existing data sets.

Abstract: Examples described herein provide for determining when individual file system operations are quiesced at a destination before validating a state of the file system object after migration. In one implementation, a metadata parameter is modified for individual file system objects after a set of mutable operations for each file system object is completed. The metadata parameter is recorded and subsequently used to determine when each of the individual file system objects are quiesced at the destination filer. The file system objects that are quiesced can be validated for migration and for implementation of any mutable file system operations that were completed at the source during the migration.

Abstract: Techniques for processing a query are provided. One or more operations that are required to process a query are performed by a coprocessor that is separate from a general purpose microprocessor that executes query processing software. The query processing software receives a query, determines one or more operations that are required to be executed to fully process the query, and issues one or more commands to one or more coprocessors that are programmed to perform one of the operations, such as a table scan operation and/or a lookup operation. The query processing software obtains results from the coprocessor(s) and performs one or more additional operations thereon to generate a final result of the query.

Abstract: A modular search object framework provides modular search results including entity search results reflecting the intent of a searcher. Also, an interface (such as a graphical user interface provided by the framework), aids in organizing results (such as links, titles, and description) according to the intent of the user as manifest in the search query and interactions with the interface. Circuitry of the framework also predicts user intent from historical information corresponding to the searcher (or to a group with which the searcher is associated).

Abstract: A server may receive a search query indicative of an object. The server may identify a 3D model from within a database of 3D object data models that corresponds to the object. The 3D model may be associated with information that pertains to the object. The server may determine an updated search query based on the information associated with the 3D model. The updated search query may be indicative of one or more of an environment of the object, an orientation of the object in the environment, a position of the object in the environment, or an identification of one or more other objects in the environment. The server may provide one or more search query results that include data pertaining to the object based on the updated search query.

Abstract: Systems and methods for massive model visualization in product data management (PDM) systems. A method includes storing a database for a partially-unconfigured product data structure that includes configured components and unconfigured components in a product data management (PDM) server system. The method includes responding to component identifier requests from a client system by sending requested component identifiers from the product data structure to the client system, wherein the component identifier requests correspond to visible components of an assembly represented by the product data structure. The method includes transmitting geometric data to the client system, the geometric data corresponding to configured occurrences of the product data structure associated with the requested component identifiers.

Abstract: Systems and methods for manipulating data records in a byte accessible format are provided. Records may be loaded into one of two byte accessible files or arrays, with a determined record length added to the beginning and/or end of each record. Records may then be slewed between the two files and records added, removed, or modified at the split between the two files.

Abstract: Technology is disclosed for context sensitive synchronization of a distributed cloud-based file system across multiple devices and for providing seamless merging of conflicting data objects. In some embodiments, data objects of a user are stored across multiple computing devices associated with a user, e.g., mobile computing devices such as a tablet, a laptop, or a smartphone, and/or at server systems, e.g., cloud-based storage servers, in a distributed cloud-based storage system. The described technology intelligently synchronizes the data objects based on context and manages potential conflicts.

Abstract: Method of searching comprising applying a function to individual elements within a digital work to form a set of index elements. Storing the index elements as an index for the digital work. Receiving a search term. Applying the function to one or more individual elements within the search term to convert the search term into one or more converted search term elements. Identifying a digital work having an index containing one or more index elements that match one or more of the converted search term elements. Returning search results of the identified digital work. Searchable index for a digital work formed by applying a function to individual elements within the digital work to form a set of index elements.

Abstract: The present disclosure describes a method, an apparatus and a system of intelligent navigation. In one embodiment, a method includes: receiving a user inquiry from a client terminal; searching a navigation dictionary based on the user inquiry to obtain a recommendation result corresponding to the user inquiry, the navigation dictionary including an editor recommendation based on user behavior information; and sending the recommendation result to the client terminal. The present disclosure can enhance the accuracy, relevancy, richness and intelligence of the intelligent navigation, and reduce user search time as well as the search loading on the server.

Abstract: A database system may include a database service and a separate distributed storage service. The database service (or a database engine head node thereof) may be responsible for query parsing, optimization, and execution, transactionality, and consistency, while the storage service may be responsible for generating data pages from redo log records and for durability of those data pages. For example, in response to a write request directed to a particular data page, the database engine head node may generate a redo log record and send it, but not the data page, to a storage service node. The storage service node may store the redo log record and return a write acknowledgement to the database service prior to applying the redo log record. The server node may apply the redo log record and other redo log records to a previously stored version of the data page to create a current version.

Abstract: A first candidate answer to a time-sensitive question received by a question answering (QA) system is identified using a first document. A first temporal confidence subscore of the first candidate answer is then calculated using a first temporal confidence rule. A first general confidence score is then generated based on at least the first temporal confidence subscore. A second candidate answer to the question is identified using a second document. A second temporal confidence subscore of the second candidate answer is then calculated using a second temporal confidence rule. A second general confidence score is then generated based on at least the second temporal confidence subscore. The first general confidence score and the second general confidence score are then compared. Based on this comparison, a final answer is selected from the first candidate answer and the second candidate answer.

Abstract: A query processing system (QPS) for generating query suggestions to a user by matching the user's input query against a set of query-detection grammars defined by respective rule modules, and with respect to a structured knowledge base. In response to the matching operation, the QPS may generate a set of synthetic query suggestions to the user, representing refinements of the user's input query. The QPS can also present a refinement tool that conveys refinement options to the user. The QPS may also present one or more preview items to the user upon the user's selection of one of the synthetic query suggestions. Each synthetic query suggestion and each preview item is guaranteed to having a matching counterpart information item in the structured knowledge base.

Abstract: A computer system, a computer-readable non-transitory medium, and/or a computer-implemented method generates analytics applicable to data of an undetermined structure and type. A processor device receives data formatted in an undetermined structure. The processor device discovers, in a cross filter model processor, dynamically in response to receiving the data in the undetermined structure, a structure and a data type of the data which was received in the undetermined structure. The processor device determines, in response to the structure and the data type of the data discovered by the cross filter model processor, which of a plurality of analytic queries are applicable to the data.

Abstract: A first candidate answer to a time-sensitive question received by a question answering (QA) system is identified using a first document. A first temporal confidence subscore of the first candidate answer is then calculated using a first temporal confidence rule. A first general confidence score is then generated based on at least the first temporal confidence subscore. A second candidate answer to the question is identified using a second document. A second temporal confidence subscore of the second candidate answer is then calculated using a second temporal confidence rule. A second general confidence score is then generated based on at least the second temporal confidence subscore. The first general confidence score and the second general confidence score are then compared. Based on this comparison, a final answer is selected from the first candidate answer and the second candidate answer.