06th week of 2017 patent applcation highlights part 43 |
Patent application number | Title | Published |
20170039190 | Two Way (+) Language Translation Communication Technology - The two way plus verbal communication technology will allow for two or more people to communicate with one another in real time by converting the spoken word from one communicator (sender) to the other communicator (receiver) by converting both of their primary or preferred languages between both parties in real time. | 2017-02-09 |
20170039191 | LINGUISTIC ANALYSIS AND CORRECTION - Methods, computer program products, and systems for correcting a glyph in a translated text are described. In one embodiment, the method includes identifying a first form of a first glyph in a translation text having a plurality of contextual properties and analyzing, by the processor, the first form of the first glyph with reference to one or more glyph form tables comprising a plurality of forms of the first glyph based, at least in part, on the plurality of contextual properties. | 2017-02-09 |
20170039192 | LANGUAGE GENERATION FROM FLOW DIAGRAMS - A computer-implemented method for language generation of a flow diagram, which receives a flow diagram. A plurality of geometric shapes within the flow diagram is identified. A plurality of text elements within the flow diagram is identified. The plurality of text elements and corresponding geometric shapes are associated. The association between the plurality of geometric shapes are identified. A diagram matrix based on the associations between the plurality of geometric shapes is generated. A linear language representation of the diagram matrix is generated. | 2017-02-09 |
20170039193 | LANGUAGE GENERATION FROM FLOW DIAGRAMS - A computer-implemented method for language generation of a flow diagram, which receives a flow diagram. A plurality of geometric shapes within the flow diagram is identified. A plurality of text elements within the flow diagram is identified. The plurality of text elements and corresponding geometric shapes are associated. The association between the plurality of geometric shapes are identified. A diagram matrix based on the associations between the plurality of geometric shapes is generated. A linear language representation of the diagram matrix is generated. | 2017-02-09 |
20170039194 | SYSTEM AND METHOD FOR BUNDLING DIGITIZED ELECTRONIC RECORDS - A system and method for organizing batches or groups of hard-copy documents into related sets of electronic documents is disclosed. An automatic digitizing unit can accept multiple physical documents and digitize those documents to generate electronic documents that includes electronic copies of the physical document. Machine encoded text may be generated from the electronic copy corresponding to the readable characters in the electronic document. The machine encoded text may be searched to determine whether the document is of the type to be included in a given set of electronic documents. Batches of hard-copy documents may be separated by separator documents defining the start and/or end of a group of documents. Document sets may be automatically separated into one or more sets after digitizing based on patient, physician, or other information in the documents. The electronic sets of documents may then be stored in a knowledge base for later retrieval as a single document. | 2017-02-09 |
20170039195 | HAPPY FACTOR SERVICE SYSTEM AND METHOD OF PROVIDING HAPPY FACTOR SERVICE USING THE HAPPY FACTOR SERVICE SYSTEM - Provided are a happy factor service system which collects, analyzes, and processes happy factor information for various individuals to provide a corresponding individual with a happy factor service and a method of providing the happy factor service using the system. The system includes a happy factor management server and a plurality of personal terminals connected thereto through a wired or wireless communication network, comprising an information input module, a database module which stores data obtained from the information input module and each module and provides data necessary for each module, a data analyzing module which analyzes the information obtained from the information input module, a happy factor extraction module which extracts a happy factor from the data analyzed by the data analyzing module, and a guideline generating module which compares the happy factor extracted by the happy factor extraction module with standard data and provides a guideline. | 2017-02-09 |
20170039196 | COMPUTING SYSTEM TO EVALUATE SENTIMENT OF ENTITIES BY PROCESSING DATA - In sentiment evaluation in procurement and auctions, keywords associated with sentiments of an entity are dynamically extracted from sources. Based on the extracted keywords, weighted sentiment indicators of the entity are calculated based on corresponding weights associated with the sources and corresponding sentiment indicators of the keywords in the server system. A weighted sentiment value of the entity is dynamically calculated based on weighted sentiment indicators of the entity in a server system. The weighted sentiment value of the entity is mapped to a sentiment representation in the server system. The sentiment representation is received in a frontend application system from the server system. The frontend application system communicates with the server system via application program interfaces. The sentiment representation of the entity is displayed in a graphical user interface as a result of sentiment evaluation of the entity. | 2017-02-09 |
20170039197 | Search Intent for Queries - In one embodiment, a method includes receiving, from a client system of a first user, a query comprising one or more n-grams, determining one or more search intents of the query based at least on whether one or more of the n-grams in the query match terms corresponding to a search intent indexed in a pattern-detection model, generating one or more search results based on the query, each search result corresponding to an object of a plurality of objects, and scoring the search results based on one or more of the search intents. | 2017-02-09 |
20170039198 | VISUAL INTERACTIVE SEARCH, SCALABLE BANDIT-BASED VISUAL INTERACTIVE SEARCH AND RANKING FOR VISUAL INTERACTIVE SEARCH - A method for user identification of a desired document is provided. The method includes receiving an identification of a prototype document, providing a database identifying a catalog of documents, identifying as candidate documents all documents within the catalog of documents which are within a threshold T | 2017-02-09 |
20170039199 | SELECTING AND ORDERING GROUPS OF TITLES - Techniques for selecting and ordering groups of titles to present as recommendations. In one embodiment, for example, a method performed by one or more computing devices of an online services comprises selecting, for each of a plurality of row positions, a group of titles to fill the row position based at least in part on a relevance score computed for the group of titles. The relevance score is based at least in part on a personalized ranking for a particular user of titles in the groups in titles selected to fill the row positions. The groups of titles selected to fill to the row positions are presented as recommendations to the particular user as a sequence of rows in which each row in the sequence corresponds to one of the selected groups of titles. | 2017-02-09 |
20170039200 | EVALUATING USER EXPERIENCE - Evaluating user experience for an application includes collecting, for each of a plurality of user sessions, a list of user event data items experienced from a perspective of a user device during that user session. For each user session, a session score is discerned based on an analysis of that user session's list of user event data items. Each session score is associated with a corresponding one of the plurality of users. For each of a plurality of successive time periods, user scores are discerned for each of the plurality of users. Each user score is discerned as a function of all session scores associated with that user where those session scores are for user sessions occurring during that time period. For each of the successive time periods, a period score is discerned as a function of the user scores discerned for that time period. The time period score discerned for a selected one of the successive time periods can be reported. | 2017-02-09 |
20170039201 | TRANSFERRING ARCHIVED DATA - A system for transferring archived data comprises one or more interfaces, each operable to read data from magnetic storage tape, and one or more processors communicatively coupled to the one or more interfaces and operable to: identify a file stored on a magnetic storage tape, the file having a first format, identify a date associated with the identified file, identify one from a plurality of intermediate platforms based at least in part on the identified date, the intermediate platforms operable to access data from file formats associated with a range of dates, transfer the identified file to the identified intermediate platform, access data in the identified file using the identified intermediate platform, transfer the accessed data from the identified intermediate platform to a contemporary software platform, and store the accessed data in a second format. | 2017-02-09 |
20170039202 | AUTOMATED DATA INTAKE SYSTEM - In a system automatically processing data from a first computing device for use on a second computing device, a registry file including a plurality of filename parameters is read. Each filename parameter identifies a matching filename pattern, an extract script indicator, and a read file indicator. The extract script indicator indicates an extract script for a file having a filename that matches the matching filename pattern. The read file indicator indicates how to read the file having the filename that matches the matching filename pattern. One parameter of the plurality of filename parameters is selected by matching a filename of a source file to the matching filename pattern of the one parameter. The associated extract script is selected and used to read data from the source file using the associated read file indicator and the read data is output to a different file and in a different format. | 2017-02-09 |
20170039203 | File Management Method and File System - A file management method and a file system are applied to the field of data processing technologies. The file system monitors input/output (IO) access information for operating a file, then determines an IO access mode of the file, determines a corresponding file management policy according to the IO access mode, and finally, when the obtained file management policy is inconsistent with a current management manner of the file, adjusts, according to the determined file management policy, the current management manner of the file, for example, a storage medium and a file management granularity, so as to dynamically adjust the storage medium and the file management granularity of the file according to the IO access mode of the file. | 2017-02-09 |
20170039204 | SETTING EXPIRATION OF SOCIAL MEDIA POSTS - Methods, apparatus, systems and articles of manufacture are disclosed for expiration of social media posts. An example method includes analyzing a social media post on a social media profile, determining a characteristic of the social media post, and setting an expiration time at which the social media post is to be removed from the social network interface based on the characteristic. | 2017-02-09 |
20170039205 | DYNAMIC RADIUS THRESHOLD SELECTION - The disclosure relates to dynamically selecting a radius threshold for a device. The system identifies, based on sensor data detected by a sensor of the device, a location of the device. The system generates a feature representation for each of a plurality of features based on a query input into the device, the location of the device, and a plurality of entity locations corresponding to the query. The system accesses a data structure storing optimum radii correlated with a presence of the plurality of features and a corresponding performance metric based on network activity. The system determines the radius threshold based on the optimum radii and the plurality of features. The system identifies an eligible entity location having a distance from the device that is within the radius threshold. The system selects, for display on the device, a content item for the eligible entity location. | 2017-02-09 |
20170039206 | AUTO GROUPING BROWSER TABS - A computer implemented method and system for managing browser tabs includes identifying a plurality of URLs (Uniform Resource Locator(s)) in response to detecting the URLs in a web browser running on a computer. The plurality of URLs are organized based on each of the URLs, and each of the plurality of URLs correspond to a tab opened by the web browser. The tabs of the web browser are grouped based on the URLs. | 2017-02-09 |
20170039207 | METHOD AND SYSTEM FOR PROVIDING CONDITION REPORTS FOR VEHICLES - A method of providing a condition report for a vehicle using a mobile device including a display includes constructing a plurality of condition report sections using a condition report application database residing in a cloud based server service and infrastructure to process requests from the mobile device including: capturing data, on the mobile device, for constructing at least one condition report section of the plurality of condition report sections; and accessing, from the mobile device, a condition report document database and/or a condition report images database residing in the cloud based server service and infrastructure for constructing and storing the plurality of condition report sections. The method includes providing user input indicative that the plurality of condition report sections have been completed, and providing user input indicative of a decision to publish the completed condition report sections as the condition report for the vehicle. The published condition report is viewable by a party by an Internet accessible web browsing device. | 2017-02-09 |
20170039208 | INTELLIGENCE CENTERS - Disclosed herein, among other things, is a system comprising a content repository, a communication portal developer, a content manager, and an analytic engine. The content repository is adapted to store electronic content in a computer-readable storage medium. The communication portal developer includes at least one wizard to create a plurality of customizable portals without coding software. Each customizable portal is accessible to one or more selected visitors through a web browser. The content manager is adapted to publish selectable electronic content to selectable portals. The content manager includes at least one wizard to populate and manage the electronic content within the content repository. The analytic engine analyzes electronic content use and visitor behavior while logged into their customizable portal. In various embodiments, the analytics are provided in real time or near real time. Other embodiments are disclosed herein. | 2017-02-09 |
20170039209 | QUERY SUGGESTION TEMPLATES - Methods and apparatus related to identifying a query template that includes one or more terms and a member of an entity category and ranking the query template. Query suggestions may be determined based on the query template. The ranking of the query template may be utilized to determine if the query template is a valid query template. The ranking of the template may be based on at least a count of occurrences of one or more of the entities of the entity category in past queries that conform to the query template. | 2017-02-09 |
20170039210 | Suggested Terms for Ambiguous Search Queries - In one embodiment, a method includes receiving, from a client system, a character string having n characters entered by the first user into a query field, wherein a term comprising the n | 2017-02-09 |
20170039211 | SYSTEMS AND METHODS FOR DETERMINING CONTENT SIMILARITY - Systems, methods, and non-transitory computer-readable media can obtain at least one content item for which a hash value is to be generated. A set of n-grams can be generated based at least in part on the at least one content item. A first vector can be generated based at least in part on the set of n-grams, wherein the vector maintains respective counts of n-grams in the set of n-grams. A quantized vector can be determined based at least in part on the first vector and one or more parameters. The hash value for the at least one content item can be generated based at least in part on the quantized vector. | 2017-02-09 |
20170039212 | Method and system for managing client data replacement - A computer-implemented method of managing replacement of a data file residing on a client computer to correspond to a new version residing on a server computer, the data file comprising one or more parts, the parts being sequentially ordered and grouped in plural consecutive chunks. The method comprises identifying those parts of the data file which are identical in the data file and the new version, identifying chunks comprising parts which are so identical, creating replacement chunks comprising parts not comprised in the chunks identified in the previous step, and causing only the replacement chunks to be transmitted to the client computer over a network. | 2017-02-09 |
20170039213 | DATA NORMALIZING SYSTEM - A method and apparatus for normalizing data. A computer system receives category data for a first code from a first client of a plurality of clients. The computer system also generates a category rule based on the category data. The computer system also assigns a category to a second code of a second client of the plurality of clients using the category rule. The category data is generated using input from the first client. Assigning the category to the second code of the second client comprises selecting the category rule to use to assign the category to the second code from a plurality of category rules. | 2017-02-09 |
20170039214 | DATA ANALYSIS USING MULTIPLE SYSTEMS - Data analysis is disclosed, including: receiving data to be analyzed, wherein the data includes one or more data identifiers (IDs) and one or more preset key-value pairs, wherein each preset key-value pair includes a preset key and a preset value; acquiring data to be analyzed based at least in part on the data IDs; segmenting the acquired data into one or more data elements; classifying the one or more data elements based at least in part on one preset key of the one or more preset key-value pairs; and analyzing the classified one or more data elements based at least in part on one preset value of the one or more preset key-value pairs. | 2017-02-09 |
20170039215 | IMAGE FORMING APPARATUS AND CONTROL METHOD THEREOF - An image forming apparatus can prevent deletion of necessary data, when partially deleting a bundle development area, wherein the image forming apparatus holds information for identifying a file to be treated as a deletion target exception when an application is deleted, specifying an application to be a deletion target from among a plurality of kinds of applications, and deleting a file related to the specified application, such that in deletion, the file, serving as the deletion target exception, identified based on the held information, is not deleted. | 2017-02-09 |
20170039216 | FILE PATH MODIFICATION BASED MANAGEMENT - A method for synchronizing file paths associated with computer files based on file path modifications is provided. The method may include detecting a file path modification to a referenced file path associated with a computer file. The method may also include identifying a type of the file path modification. The method may further include identifying a generated file path based on the type of the file path modification. Additionally, the method may include synchronizing the referenced file path to the generated file path. The method may also include modifying the file path information associated with the computer file. The method may further include generating association information in a file properties window associated with the referenced file path and the at least one generated file path. The method may also include validating and extracting the file path information associated with the computer file for use by at least one application. | 2017-02-09 |
20170039217 | TABLE FORMAT FOR MAP REDUCE SYSTEM - A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation. | 2017-02-09 |
20170039218 | DATA OBJECT STORE AND SERVER FOR A CLOUD STORAGE ENVIRONMENT, INCLUDING DATA DEDUPLICATION AND DATA MANAGEMENT ACROSS MULTIPLE CLOUD STORAGE SITES - Data storage operations, including content-indexing, containerized deduplication, and policy-driven storage, are performed within a cloud environment. The systems support a variety of clients and cloud storage sites that may connect to the system in a cloud environment that requires data transfer over wide area networks, such as the Internet, which may have appreciable latency and/or packet loss, using various network protocols, including HTTP and FTP. Methods are disclosed for content indexing data stored within a cloud environment to facilitate later searching, including collaborative searching. Methods are also disclosed for performing containerized deduplication to reduce the strain on a system namespace, effectuate cost savings, etc. Methods are disclosed for identifying suitable storage locations, including suitable cloud storage sites, for data files subject to a storage policy. Further, systems and methods for providing a cloud gateway and a scalable data object store within a cloud environment are disclosed, along with other features. | 2017-02-09 |
20170039219 | DEDUPLICATION BY PHRASE SUBSTITUTION WITHIN CHUNKS OF SUBSTANTIALLY SIMILAR CONTENT - A method, system and computer program product for phrase substitution within chunks of substantially similar content. The method includes: retrieving from content files a first and a second content chunk which are identical above a predetermined threshold; identifying a candidate for substitution, wherein the candidate for substitution is a string of characters in the second content chunk that is not identical to a corresponding string of characters in the first content chunk; comparing the candidate for substitution with a synonym database to find a match, wherein the synonym database provides a plurality of synonym suggestions to convert the candidate for substitution in the first content chunk and the second content chuck to an identical string of characters; replacing the candidate for substitution with a reference to the identical string of characters; and storing a single copy of the identical string of characters in a common repository. | 2017-02-09 |
20170039220 | FILE PATH MODIFICATION BASED MANAGEMENT - A method for synchronizing file paths associated with computer files based on file path modifications is provided. The method may include detecting a file path modification to a referenced file path associated with a computer file. The method may also include identifying a type of the file path modification. The method may further include identifying a generated file path based on the type of the file path modification. Additionally, the method may include synchronizing the referenced file path to the generated file path. The method may also include modifying the file path information associated with the computer file. The method may further include generating association information in a file properties window associated with the referenced file path and the at least one generated file path. The method may also include validating and extracting the file path information associated with the computer file for use by at least one application. | 2017-02-09 |
20170039221 | METHOD FOR CONSISTENT STORAGE OF DATA IN AN INDUSTRIAL CONTROLLER - A system and method for employing a file system and file system services on the industrial controller. The file system allows industrial control programs to implement many functions previously performed within the industrial control program and stored in the same memory as the industrial control program. An execution engine is provided that interprets instructions included in an industrial control program. The instructions utilize services in the file system for including user defined routine files loaded from local or remote locations, to load and unload recipe files from local and remote locations, to log and retrieve measured data and trend data to files at local or remote locations, to select different operating systems and to select a running program from a plurality of running programs utilizing the file system. | 2017-02-09 |
20170039222 | METHOD AND SYSTEM FOR COMPARATIVE DATA ANALYSIS - Embodiments of the present invention provide a method and system for comparative analysis of data records. In particular embodiments of the present invention enable a computer system to provide a template lattice as an input to computer implemented abstraction of data from records for comparative analysis, abstract record data, map one or more record data elements to a mapped position, determine a plurality of lattice elements and a set of lattice element identifiers associated with the plurality of lattice elements to provide a characterising set for the mapped position and compare first and second data records in order to determine the degree of similarity between a first characterising set and a second characterising set for the respective first and second records. The method and system can be utilised to allow comparative analysis of recorded data that may be sensitive for the individual subjects while preserving privacy of the individual subjects. | 2017-02-09 |
20170039223 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing apparatus includes a first acquiring unit configured to acquire file management information regarding one or more image files contained in a folder, a sorting unit configured to sort the file management information acquired by the first acquiring unit, a second acquiring unit configured to access image files corresponding to a first piece of the file management information and a last piece of the file management information among the pieces of file management information sorted by the sorting unit and acquire meta information regarding the two image files, and an identifying unit configured to identify a range of capture dates of the image files contained in the folder based on the meta information acquired by the second acquiring unit. | 2017-02-09 |
20170039224 | Object Information Derived From Object Images - Search terms are derived automatically from images captured by a camera equipped cell phone, PDA, or other image capturing de ice submitted to a search engine to obtain information of interest, and at least a portion of the resulting information is transmitted back locally to, or nearby, the device that captured the image. | 2017-02-09 |
20170039225 | ESTABLISHMENT ANCHORING WITH GEOLOCATED IMAGERY - The technology relates to determining an establishment's presence at a geolocation. A computing device may receive a first image including location data associated with the first image's capture. A set of images, which include location information and one or more identification marks associated with one or more establishments may also be received. The computing device may compare the first image to the set of images to determine whether the first image contains one of the one or more identification marks, and determine that one of the one or more establishments, associated with the one of the one or more identification marks contained in the first image, is currently located within a set proximity of the first image location. The computing device may also update a location database by associating the one of the one or more establishments with a location within a set proximity of the first image location. | 2017-02-09 |
20170039226 | INTELLIGENT IDENTIFICATION OF MULTIMEDIA CONTENT FOR GROUPING - An intelligent synchronization tool ensures access to desired content in a manner that automatically keeps the content current on the portable media device. A variation threshold or user-specified degree of content variation may be introduced among content downloaded to a user's mobile device to prevent the user from becoming bored. Furthermore, intelligent synchronization may automatically populate the portable media device with popular content to save a user time and/or use passive monitoring techniques to ascertain a user's preferences for subsequent population. | 2017-02-09 |
20170039227 | Data Archive Vault in Big Data Platform - Embodiments relate to data archiving utilizing an existing big data platform (e.g., HADOOP) as a cost-effective target infrastructure for storage. Particular embodiments construct a logical structure (hereafter, “vault”) in the big data platform so that a source, type, and context of the data is maintained, and metadata can be added to aid searching for snapshots according to a given time, version, and other considerations. A vaulting process transforms relationally stored data in an object view to allow for object-based retrieval or object-wise operations (such as destruction due to legal data privacy reasons), and provide references to also store unstructured data (e.g., sensor data, documents, streams) as attachments. A legacy archive extractor provides extraction services for existing archives, so that extracted information is stored in the same vault. This allows for cross queries over legacy data and data from other sources, facilitating the application of new analysis techniques by data scientists. | 2017-02-09 |
20170039228 | SYSTEM AND METHOD FOR SHARING GRAPH STRUCTURED INFORMATION WHICH ARE REPLICATED ACROSS A PLURALITY OF USER DEVICES THROUGH A LOCAL NETWORK, AND METHOD FOR SYNCHRONIZATION AND REPLICATION OF GRAPH STRUCTURED INFORMATION - A system and method are provided for sharing graph structured information which are replicated across a plurality of user devices through a local network, comprising a server for providing an channel for communicating graph of data objects with the user devices, a data controller for managing data. The data controller comprising an offline module for managing the graph of data objects stored in the system before sharing the objects in the sharing environment, and an online module for handling all the network communication with user devices and the server. The system creates a sharing environment in which the user devices are connected and each user device is able to share graph of data objects in said sharing environment, wherein the data controller performs at least one sync operation to guarantee that the data shared in the sharing environment is consisting between all user devices. | 2017-02-09 |
20170039229 | DATA COMPRESSION - Methods and system are disclosed that compress a dataset and optimize the dataset for searching data. In one aspect, based on attributes associated with a unified dataset, the dataset including sensor node identifier data, sensor node timestamp data and sensor measurement data are determined. A suffix tree algorithm may be executed to determine data compression logic to compress the dataset including the sensor node identifier data and sensor node measurement data. A sensor node timestamp data compression model may be executed to compress the dataset associated with the sensor timestamp data. The compressed datasets including the sensor node identifier data, the sensor node timestamp data and the sensor measurement data may be stored in an in-memory data store. | 2017-02-09 |
20170039230 | POOL DATA STORAGE SYSTEM & METHOD - Disclosed herein is a system that includes a server hosting a pool data receiving and storage service. The system further includes a database in communication with the server. Still further, the system includes a user communication device in communication with the server having an interface configured interact with the pool data receiving and storage service hosted by the server, the interface configured to receive a manual user input of a pool related data, the interface configured to transmit the pool related data to the server. The pool related data corresponds to chemical levels in a pool. The pool data receiving and storage service of the server is configured to receive the pool related data from the user communication device and store the pool related data in the database. The interface of the user communication device is configured to access the pool related data through communication with the server. | 2017-02-09 |
20170039231 | ACCELERATING OPERATIONS IN B+-TREE - Methods and a system are provided for accelerating an operation in a B+-tree. A method including forming triplets, by a triplet manager. Each of the triplets includes a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node. The method further includes performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation. The method also includes executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation. The operation is any one of an insertion operation, a deletion operation, and a search operation. | 2017-02-09 |
20170039232 | UNIFIED DATA MANAGEMENT FOR DATABASE SYSTEMS - A database architecture includes at least an in-memory database and a disk-based database (also referred to as “hot” and “warm” data stores). In the database architecture, data can be partitioned (and re-partitioned) and/or moved within and among the in-memory and disk-based databases, based on query access patterns derived from received database queries. The partitions and inter-database movements can be based at least in part on clustered, dynamic data units that are defined using shared individual attribute values of data records, and updated based on the received queries. | 2017-02-09 |
20170039233 | SANKEY DIAGRAM GRAPHICAL USER INTERFACE CUSTOMIZATION - A system, method, and computer program product for selecting, processing, and visually depicting information in real time using in-memory technology and user-customizable Sankey diagrams in a graphical user interface. Embodiments receive data describing contact interactions with a business establishment, select interactions occurring frequently during a given time span that led to selected target events, and aggregate similar interaction sequences into paths displayed with widths denoting relative flow quantities. Embodiments modify the depicted information according to user customization of the Sankey diagram. Coherent coordination of visual depiction by context, associated algorithms and models, data sources, event types, and various graphical indicia helps provide an intuitive exploratory situational overview and enables user-driven detailed investigations of complex data via manipulations of the Sankey diagrams. Business assessments and properly directed business actions may improve marketing campaign and customer service effectiveness and increase return on investment without requiring extensive user training or database expertise. | 2017-02-09 |
20170039234 | PRIORITY QUEUE FOR EXCLUSIVE LOCKS - A system includes reception of a first request for a lock on a lock object, storage of a first entry associated with the first request and the lock object in a queue, determination of a first queue position associated with the first entry based on a first priority level of the first request and on a priority level of each of a plurality of entries in the queue associated with the lock object, determination of whether a predetermined expiration time associated with the first request has expired, and, if it is determined that the predetermined expiration time has expired, deletion of the first entry from the queue. | 2017-02-09 |
20170039235 | AIR QUALITY METROLOGY SYSTEM - Metrology system ( | 2017-02-09 |
20170039236 | VERTICAL TUNING OF DISTRIBUTED ANALYTICS CLUSTERS - A method is provided for vertically tuning a distributed analytics cluster. The method includes receiving a job, and determining whether the job matches another job saved to a job database. The method also includes performing offline tuning for the job when the job does not match another job saved to the job database. Additionally, the method includes launching the job using a job configuration from the job database, and, after launching the job using the job configuration from the job database, performing online tuning for the job. The online tuning includes vertically tuning infrastructure-level and application-level parameters between phases of execution of the job. The method also includes updating the job configuration in the job database. | 2017-02-09 |
20170039237 | METHODS AND SYSTEMS FOR TRANSACTION PROCESSING - This disclosure relates generally to transaction processing, and more particularly to method and system for transaction processing in an application. In one embodiment, the method includes facilitating selection of an overlay application corresponding to the application. The application includes at least one window having a plurality of fields and is rendered in a first UI. At least one field of the plurality of fields is masked to obtain at least one masked field in the first UI. A second UI corresponding to the at least one window is rendered. The second UI is associated with the overlay application and includes at least one field blank field corresponding to the at least one field masked field in the first UI. Entering data is enabled in the at least one blank field in the second UI, and the data entered is compared with a prepopulated data to determine validity of the transaction. | 2017-02-09 |
20170039238 | Asymmetric Distributed Cache with Data Chains - An example method of loading data from a database includes receiving, at a cache node, a current query and a data chain that includes a sequence of ordered queries. The method also includes determining whether a hash of the current query matches a hash of an expected query in the data chain. The method further includes retrieving a result set of the current query from a local cache in response to determining that the hash of the current query matches the hash of the expected query. The method also includes sending the result set of the current query to a client. | 2017-02-09 |
20170039239 | DISTRIBUTED RESOURCE-AWARE TASK SCHEDULING WITH REPLICATED DATA PLACEMENT IN PARALLEL DATABASE CLUSTERS - A method and system, the system including a plurality of machines each having a processor and a main memory component; a shared distributed storage facility storing a set of data and accessible by the plurality of machines over a communication network; a controller to select, in response to a state of a query execution plan comprising a plurality of executable jobs for the set of data, which one of a set of scheduling algorithms to execute; an execution engine to execute the selected scheduling algorithm to determine, for each job in the plurality of jobs, which server to schedule to execute the respective job; and providing an indication of the scheduling of the servers determined to be schedules for the execution of the jobs. | 2017-02-09 |
20170039240 | Optimizer Problem Determination - A computer-implemented method includes receiving an artefact and a problem pattern, transforming the artefact into an abstracted artefact structure, and transforming the problem pattern into a query. The query is matched against the abstracted artefact structure. Any matched portions of the abstracted artefact structure are related back to corresponding result portions of the artefact. The corresponding result portions of the artefact are returned. The method may be embodied in a corresponding computer system or computer program product. | 2017-02-09 |
20170039241 | OPTIMAL ANALYTIC WORKFLOW - Embodiments of the present invention disclose a method for optimizing data analysis. A set of analytics are received and a plurality of subsets of the set of analytics is generated. An optimization goal(s) is defined. The plurality of subsets of analytics are applied to a set of data. The output of applied analytics are recorded on a data storage device by the computer. Performance values of the computer applying the plurality of subsets of analytics are recorded and displayed. An optimal subset of the plurality of subsets of analytics is calculated, using recorded performance values and outputs of the applied plurality of subsets of analytics, being based on the optimization goal. A set of applied analytics are displayed, where the set of applied analytics includes a number of subsets of analytics of the plurality of analytics that meet the criteria of the optimal subset. | 2017-02-09 |
20170039242 | BRANCHING MOBILE-DEVICE TO SYSTEM-NAMESPACE IDENTIFIER MAPPINGS - Provided is a process of merging data from feeds from multiple sources of computing device network activity data having heterogenous device identifier namespaces and device identifier to device mappings that change over time, the process including: accessing three or more sources of network activity log data from three or more different sources of network activity data, wherein: for each of the sources of network activity log data, based the respective network activity log data, updating a multi-namespace mapping that maps the external-namespace device identifiers to internal-namespace device identifiers in an internal namespace of a system configured to profile mobile computing devices based on logged network activity data of the mobile computing devices, wherein: the namespace mapping comprises a plurality of external-namespace-specific mappings each mapping a respective type of device identifier in a respective external namespace used in the network activity log data to one or more internal-namespace device identifiers. | 2017-02-09 |
20170039243 | Efficient Database Searching - Systems and methods are disclosed for efficiently searching a database including a table. The table is partitioned along a first dimension, such as latitude. Indexes in each of the partitions are built along a second dimension, such as longitude. The table may also be clustered according to an index to improve performance. When a processor receives a database query term and a starting location, the processor selects, from the table, a data partition within a first offset to the starting location along the first dimension. The processor selects, from the selected data partition, a first number of first data records related to the query term and within a second offset to the starting location along the second dimension. | 2017-02-09 |
20170039244 | SIMPLIFICATION OF SANKEY DIAGRAM - The present disclosure generally relates to systems and methods for visualizing data. More specifically, the embodiments described herein generally relate to data manipulation algorithm(s) configured to position and/or identify unique node(s) with visualized data. The systems and methods retrieve one or more data structure(s), graphically align nodes having same level values, identify and remove duplicate nodes, and graphically render the data structures(s) as a Sankey diagram. | 2017-02-09 |
20170039245 | SELECTING QUERIES FOR EXECUTION ON A STREAM OF REAL-TIME DATA - A computer-implemented method for executing a query on data items located at different places in a stream of near real-time data to provide near-real time intermediate results for the query, as the query is being executed, the method including: from time to time, executing, by one or more computer systems, the query on two or more of the data items located at different places in the stream, with the two or more data items being accessed in near real-time with respect to each of the two or more data items; generating information indicative of results of executing the query; and as the query continues being executed, generating intermediate results of query execution by aggregating the results with prior results of executing the query on data items that previously appeared in the stream of near real-time data; and transmitting to one or more client devices the intermediate results of query execution, prior to completion of execution of the query. | 2017-02-09 |
20170039246 | TEAM ANALYTICS CONTEXT GRAPH GENERATION - A method for team analytics context graph generation may include extracting, by a processor, a set of relevant features from a received message and evaluating the relevant features that represent a context of the received message. The method may also include retrieving, by the processor, artifacts from the received message that best represent the context of the received message based on the evaluation of the relevant features and generating a context graph based on the artifacts. The method may additionally include presenting, by the processor, the context graph. | 2017-02-09 |
20170039247 | FACILITATING DYNAMICALLY CONTROLLED FETCHING OF DATA AT CLIENT COMPUTING DEVICES IN AN ON-DEMAND SERVICES ENVIRONMENT - In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamically controlled fetching of data at client computing devices in an on-demand services environment in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes receiving, at a server computing device, a request from a client computing device. The request includes a query for receiving data from a database coupled to the server computing device in an on-demand database system. The method may further include matching the request against a predetermine threshold value, and where the threshold value includes a first predetermined threshold range based on a first column range or a first row range and a second predetermined threshold range based on a second column range or a second row range. The method may further include generating multiple responses to the request based on one or more formulae and the predetermined threshold value if the request fails to satisfy the predetermined threshold value. | 2017-02-09 |
20170039248 | CONTEXT-BASED ACTIONS FROM A SOURCE APPLICATION - An action framework system provides context-based actions in association with a source application. The source application detects selection of a content element presented by the source application. The content element is associated with an application identifier identifying a target application and an action identifier identifying an operation to be executed by the target application on the content element. The target application identified by the application identifier is executed to perform the operation identified by the action identifier on the content element, responsive to detection of the selection of the content element. In one implementation, the source application is a search feature providing different contexts of search results (e.g., from a local file system search, a local application content search, a Web search, a remote application content search). | 2017-02-09 |
20170039249 | OPTIMAL ANALYTIC WORKFLOW - Embodiments of the present invention disclose a method, computer program product, and system for optimizing data analysis. A set of analytics are received and a plurality of subsets of the set of analytics is generated. An optimization goal(s) is defined. The plurality of subsets of analytics are applied to a set of data. The output of applied analytics are recorded on a data storage device by the computer. Performance values of the computer applying the plurality of subsets of analytics are recorded and displayed. An optimal subset of the plurality of subsets of analytics is calculated, using recorded performance values and outputs of the applied plurality of subsets of analytics, being based on the optimization goal. A set of applied analytics are displayed, where the set of applied analytics includes a number of subsets of analytics of the plurality of analytics that meet the criteria of the optimal subset. | 2017-02-09 |
20170039250 | Method of Generating Smart Outputs in Real Time from Aggregated Data Using Data Mining Algorithms - A method of generating smart outputs in real time from aggregated data using data mining algorithms analyzes user-submitted data or retrieved third-party data with data mining algorithms in order to produce results that help the users to make informed decisions. Users submit data, query the system, and receive smart outputs from the data mining process in real time. | 2017-02-09 |
20170039251 | HANDLING DATA REQUESTS - Handling data requests directed to a database environment including a first platform, a second platform, and a control unit. The control unit receives a request, determines a prepared result corresponding to the data request and compares an update indicator of the determined prepared result with a threshold value. In response to the comparison, the control unit either retrieves the prepared result from the second platform and returns it or retrieves an updated version of the at least one prepared result from the first platform, updates the prepared result in the second platform and the associated update indicator, and returns the updated version of the prepared result. The update indicator may be defined by (1−acc)·t, wherein acc is a probability that the associated prepared result is valid and t is an age of the associated prepared result. | 2017-02-09 |
20170039252 | PROCESSING A QUERY VIA A LAMBDA APPLICATION - An approach is described of query processing via a lambda application including a batch processing layer and a speed processing layer. The approach may improve speed and efficiency with respect to computation of query results associated with the batch processing layer. A method pertaining to such approach may include receiving a query including an initial timeframe and computing partial query results within the initial timeframe. The partial query results within the initial timeframe may include a result for data associated with the speed processing layer and results for a first set of data segments associated with the batch processing layer. The method further may include combining the partial query results within the initial timeframe into a final query result. The method further may include computing partial query results outside of the initial timeframe including results for a second set of data segments associated with the batch processing layer. | 2017-02-09 |
20170039253 | PROVIDING FULL DATA PROVENANCE VISUALIZATION FOR VERSIONED DATASETS - Systems and methods for providing full data provenance visualization for versioned datasets. A method includes receiving selection of a versioned dataset that is within a data pipeline system. The method also includes determining the full data provenance of the selected versioned dataset. The full data provenance may comprise a set of versioned datasets. The method further includes providing for display of a visualization of the full data provenance of the selected versioned dataset. The visualization comprises a graph. The graph comprises a compound node for the selected versioned dataset and for each versioned dataset in the set of versioned datasets. The graph further comprises edges connecting the compounds nodes. Each edge represents a derivation dependency between versions of the versioned datasets represented by the compound nodes connected by the edge. | 2017-02-09 |
20170039254 | SEARCHING AND VISUALIZING DATA FOR A NETWORK SEARCH BASED ON RELATIONSHIPS WITHIN THE DATA - In searching data on a network, a data set is retrieved from the network based on a search query. Relationships between data of the retrieved data set are determined and a visualization representing related data of the retrieved data set based on the determined relationships is generated and presented. The data of the retrieved data set is accessed based on a selection of represented data within the visualization. | 2017-02-09 |
20170039255 | Computer Implemented System and Method for Integrating and Presenting Heterogeneous Information - A computer implemented system and method for integrating and presenting heterogeneous information is envisaged. The system slices and dices information and enables the information to be depicted in the form of dashboards and reports by tying data points on different sources into an integrated solution, and also enables a user to select the information that he/she wants to view, thereby enabling real-time visibility, quick decision making and planning The system allows easy interaction between teams to access and understand complex information quickly. The system of the present disclosure can integrate data spread across multiple domains, horizontals and verticals, and display the required result in a desired format. The system also has ability to restrict dashboards and reports to certain groups of users by means of profiling based on roles in the organization. | 2017-02-09 |
20170039256 | APPARATUS AND METHOD TO PROCESS PIECES OF COLLECTED DATA BASED ON DATA ARRIVAL STATES - An apparatus collects record data from a plurality of information sources. When a process to be performed on the collected record data is determined, with reference to definition information on the process, to be able to generate result data from a single piece of the record data, the apparatus starts the process on the collected record data without waiting for an arrival of all the record data as a collection target from the plurality of information sources. When pieces of the record data are required to be referenced in order for the process to generate the result data and the pieces of the record data includes an uncollected piece of the record data, the apparatus starts the process in response to completion of collecting all the record data as the collection target from the plurality of information sources. | 2017-02-09 |
20170039257 | CALLABLE CHANGE RECORD DATA - This disclosure relates to improving the efficiency and quality of real-time extracting, transforming, and/or loading data using customer information control system (CICS) interval control element (ICE) chain processing. | 2017-02-09 |
20170039258 | Efficient Location-Based Entity Record Conflation - Systems and methods for providing efficient entity record conflation are presented. According to aspects of the disclosed subject matter, a first processing phase is made in regard to conflating location data of a corpus of entity records. This first processing phase is conducted in an offline, asynchronous manner to aggregate the entity records of a corpus of entity records into location clusters, each location cluster of entity records considered to correspond to a same structure at a particular geographic location. A second processing phase is conducted in a near real-time manner in regard to conflating received entity records with the entity records of the corpus of entity records. This second processing phase first matches received entity records to a location cluster, and then matches a received entity record to an entity record within the location cluster. Upon matching the received entity record with an entity record in a location cluster, the two entity records are conflated. | 2017-02-09 |
20170039259 | Method and Apparatus for Implementing Storage of File in IP Disk - A method and an apparatus for implementing storage of a file in an Internet Protocol (IP) disk, where the method includes receiving an operation request for a target file, converting operation information of the operation request into a key value of the target file, acquiring, according to the key value, an identifier of a target IP disk corresponding to the operation request, and sending, to the target IP disk identified by the identifier, the operation request carrying the key value such that the application stability can be improved. | 2017-02-09 |
20170039260 | View Maintenance Rules for an Update Pipeline of an Object-Relational Mapping (ORM) Platform - Application data is synchronized with a database where changes to object data maintained by an application is expressed according to an application schema. Changes to the object data are identified as corresponding to an entity schema. Changes to views of database tables are applied by translation rules to the set of changed entities. The database tables conforming to a database schema are thereafter updated. | 2017-02-09 |
20170039261 | INITIALIZATION PROTOCOL FOR A PEER-TO-PEER REPLICATION ENVIRONMENT - Techniques for initializing a connection in a peer-to-peer replication environment. Responsive to a request to add a target node to a data replication group, embodiments receive a first message, at a target node, from an initiator node within the data replication group, indicating that the initiator node will begin replicating changes to the target node without waiting for any acknowledgements relating to the first message. The changes are applied to a first instance of a data entity on the initiator node. A second message is transmitted, from the target node, to at least one other member in the data replication group, announcing that the target node is joining the data replication group. Embodiments receive a plurality of replicated changes, at the target node, from the initiator node, and process each replicated change in the plurality of replicated changes against a second instance of the data entity at the target node. | 2017-02-09 |
20170039262 | METHOD FOR REBALANCING DATA PARTITIONS - Embodiments of the present invention disclose a computer program product for rebalancing partitioned data based, at least in part, on limit key extrapolation in a database and one or more characteristics of the plurality of database partitions. Responsive to a determination that an upper limit key value of the last loaded record is greater than an upper limit key value of an empty partition, the computer redefines the upper limit key value of the empty partition using an extrapolated upper limit key value that is based, at least in part, on a range of limit key values. The computer updates one or more characteristics of the database, wherein the one or more characteristics include one or both of a) an average number of records per partition, and b) an average number of unique limit key values per partition. | 2017-02-09 |
20170039263 | COMPUTER SYSTEM - A computer system, comprising a plurality of computers; and a management computer, wherein a plurality of data stores which store data obtained from a data source and having differing attributes, wherein the management computer has a request allocation unit and holds metadata management information. The request allocation unit is configured to: refer to the metadata management information to select a candidate data store based on analysis results of the data obtaining request including the time attribute of the requested data; determine whether the requested data can be obtained from the candidate data store; determine a data store to which to issue a request for obtaining the requested data; and issue the request to the determined data store. | 2017-02-09 |
20170039264 | AREA MODELING BY GEOGRAPHIC PHOTO LABEL ANALYSIS - The technology relates to determining a description of a geographic area. One or more computing devices may receive a set of images, wherein each image includes data associated with geolocation data and labels describing the contents of the images. Each image in the set of images may be assigned to one or more buckets corresponding to a geographic area based at least in part on the geolocation information. Based on an inquiry identifying one or more geolocations, a set of one or more buckets that are associated with geographic areas that cover the one or more geolocations may be determined. Labels associated with the images assigned to the set of buckets may be identified and a description of the one or more geolocations may be generated. The description may be provided in response to the request. | 2017-02-09 |
20170039265 | METHOD AND SYSTEM FOR DISTRIBUTED LATENT DIRICHLET ALLOCATION COMPUTATION USING ADDITION OF APPROXIMATE COUNTERS - Herein is described a data-parallel algorithm for topic modeling on a distributed system in which memory and communication bandwidth requirements are streamlined for distributed implementation. According to embodiments, a distributed LDA Gibbs sampling algorithm shares approximate counter values amongst the nodes of a distributed system. These approximate counter values are repeatedly aggregated and then shared again to perform the distributed LDA Gibbs sampling. In order to maintain the shared counter values as approximate counter values of sixteen bits or less, approximate counter values are summed to produce aggregate approximate counter values. These small aggregate approximate counter values are shared between the nodes of the distributed system. As such, the addition of various types of approximate counters is described herein. Specifically, addition of binary Morris approximate counters, general Morris approximate counters, and Csürös approximate counters are described in the context of distributed implementations of an LDA Gibbs sampling algorithm. | 2017-02-09 |
20170039266 | METHODS AND SYSTEMS FOR MULTI-CODE CATEGORIZATION FOR COMPUTER-ASSISTED CODING - Computer implemented methods and systems for assisting a user to select one or more codes from a set of available codes to categorize a record. The method includes (a) receiving information on a record to be categorized; (b) determining a set of multiple candidate codes to suggest to the user that is a subset of the set of available codes having a greater likelihood of accurately matching the applicability criteria for the codes for the record than other codes, the set of candidate codes including candidate code(s) selectable by the user to be assigned to the record among other possible candidate codes; (c) presenting the set of multiple suggested candidate codes to the user for assessment; (d) receiving a user selection input of a code or codes to be associated with the record; and (e) assigning the selected one or more codes to the record to categorize the record. | 2017-02-09 |
20170039267 | AUTOMATIC QUERY PATTERN GENERATION - One general aspect is described that includes a computer implemented method for generating a pattern graph. The method may include accessing data pertaining to a corpus of web documents. The data may include a plurality of query-document pairs. The method may also include identifying at least one query pattern in the plurality of query-document pairs and the query pattern may be associated with a portion of web documents in the corpus. The method may also include identifying a plurality of sub-phrases in the at least one query pattern, determining, in the corpus of web documents, a plurality of other query patterns that include at least one of the plurality of sub-phrases, and assigning an classifier to the at least one query pattern and each of the plurality of other query patterns that include at least one of the sub-phrases. | 2017-02-09 |
20170039268 | INFORMATION PROCESSING APPARATUS AND INDEX DIMENSION EXTRACTING METHOD - An information processing apparatus includes: a memory configured to store a plurality of structures of a substance whose structure changes and a dimension group, which is a group of index dimensions that are indices for structural analysis of the substance, out of a plurality of dimensions that express the structure of the substance; and a processor configured to perform a procedure including: performing, for each of a plurality of candidate dimensions, which are not included in the dimension group, out of the plurality of dimensions, clustering of a plurality of structures in multidimensional space that has every index dimension included in the dimension group and a candidate dimension as coordinate axes; and adding a specified candidate dimension for which it is possible to generate a largest number of clusters to the dimension group as an index dimension. | 2017-02-09 |
20170039269 | CLIENT INTENT IN AN INTEGRATED SEARCH ENVIRONMENT - Architecture that operates in combination with an integrated search framework to derive user intent associated with a search query, and then based on the derived intent, choose the search method: a local search on the current local device from which the search is initiated, a non-local search of data sources other than the local device, or both the local search and the non-local search. The query context can be derived to more effectively assess the query intent. The architecture employs predictive models trained with candidate features that enable the prediction of a singular intent (or degree of intent) in the integrated search environment. The models can be trained using historical and real-time features. A classifier is trained using the features. The user intent is then derived based on the classifier output and the search is performed accordingly. | 2017-02-09 |
20170039270 | DETERMINING A GROUP RECOMMENDATION - A method, computer program product, and computer system is provided. A processor identifies a shared property between a user of a social network and a group of the social network. A processor identifies an unshared property between the user of the social network and the group of the social network. A processor determines a first percentage of the one or more members of the group with the shared property. A processor determines a second percentage of the one or more members of the group with the unshared property. A processor generates a recommendation score for the group based, at least in part, on the first and second percentage. | 2017-02-09 |
20170039271 | Scoring Automatically Generated Language Patterns for Questions using Synthetic Events - An approach is provided in which a knowledge manager identifies training entities in a training question answer pair and identifies multiple database paths a database that link the training entities. The knowledge manager then generates multiple generalized queries based upon the identified multiple database paths and assigns query scores to the multiple generalized queries. In addition, the knowledge manager generates a generalized syntactic pattern based upon syntactic relationships between the training entities in the training question answer pair. When the knowledge manager receives a question and matches the syntactic pattern of the received question to the generalized syntactic pattern, the knowledge manager generates custom queries from the generalized queries and queries the database using the custom queries. The knowledge manager, in turn, scores answers generated from the custom queries based upon the custom queries' corresponding query scores. | 2017-02-09 |
20170039272 | NLP-BASED CONTENT RECOMMENDER - Methods, techniques, and systems for using natural language processing to recommend related content to an associated text segment or document. Example embodiments provide a NLP-based content recommender (“NCR”) which uses NLP-based search techniques, potentially in conjunction with context or other related information, to locate and provide content related to entities that are recognized in the associated material. NCRs may be embedded as widgets, for example on Web pages to assist users in their perusal and search for information, provided by means of browser plug-ins or other application plug-ins, provided in libraries or in standalone environments, or otherwise integrated into other code, programs, or devices. This abstract is provided to comply with rules requiring an abstract, and it is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims. | 2017-02-09 |
20170039273 | SYSTEM AND METHOD FOR GENERATING A CUSTOMIZED SINGULAR ACTIVITY STREAM - A method and system for causing displays of a customized activity stream are provided. The method includes gathering a plurality of contextual activity streams, wherein the plurality of contextual activity streams is generated based on unstructured data collected from a plurality of data sources, wherein the generation of the plurality of contextual activity streams includes determining a context of the unstructured data based on at least one tag of the unstructured data; generating a customized singular activity stream based on at least one user-related parameter and at least one node-related parameter of a client node, wherein the customized singular activity stream includes a plurality of data items from the plurality of contextual activity streams; and causing a display of the customized singular activity stream over the client node. | 2017-02-09 |
20170039274 | IDENTIFICATION AND QUANTIFICATION OF PREDATORY BEHAVIOR ACROSS COMMUNICATIONS SYSTEMS - Methods, systems, apparatuses, and computer program products are provided that enable the identification of predatory behavior in communications systems. A plurality of textual messages of a message repository is queried with a plurality of sets of key phrases to determine and score textual messages that include one or more of the key phrases of the sets. Each scored textual message includes a suspect, a potential victim, and a score. Each suspect-to-potential victim pair corresponds to a conversation that includes the scored textual messages between the suspect and potential victim of the pair. A plurality of conversation risk scores is determined based at least on the scored textual messages. Each conversation risk score indicates an estimate of a risk of predatory behavior occurring during the corresponding conversation. | 2017-02-09 |
20170039275 | Automated Article Summarization, Visualization and Analysis Using Cognitive Services - A mechanism is provided in a data processing system for article summarization. The mechanism analyzes an article to identify entities and relationships within the article. The article is an item of unstructured content. The mechanism performs information augmentation based on the identified entities and relationships using one or more cognitive services to collect augmented information from a corpus of information. The mechanism generates one or more visualization components based on the identified entities and relationships and the augmented information. The mechanism presents a summarization comprising the one or more visualization components to a user. | 2017-02-09 |
20170039276 | AUDIO MATCHING BASED ON HARMONOGRAM - In an example context of identifying live audio, an audio processor machine accesses audio data that represents a query sound and creates a spectrogram from the audio data. Each segment of the spectrogram represents a different time slice in the query sound. For each time slice, the audio processor machine determines one or more dominant frequencies and an aggregate energy value that represents a combination of all the energy for that dominant frequency and its harmonics. The machine creates a harmonogram by representing these aggregate energy values at these dominant frequencies in each time slice. The harmonogram thus may represent the strongest harmonic components within the query sound. The machine can identify the query sound by comparing its harmonogram to other harmonograms of other sounds and may respond to a user's submission of the query sound by providing an identifier of the query sound to the user. | 2017-02-09 |
20170039277 | GENERATING SEQUENCES OF PROGRAM ITEMS - Systems and techniques, including computer program products, for generating sequences of program items. A specification of a sequence is received. A specification of multiple sets, where each set includes one or more program items, is also received. An output sequence of program items is generated by selecting program items from the sets based on the specified sequence. In some implementations, program items are selected by assigning each program item a score, and identifying the program item with the best score. An attribute can be associated with each program item. The attributes can be used to group the program items into sets, to determine the scores of the program items, and to select program items to be placed in the generated output sequence. The rules and the set sequence can be adjusted dynamically, and the generated output sequence can be modified by adding, removing, or replacing program items. | 2017-02-09 |
20170039278 | ANNOTATING SOCIAL GRAPH EDGES WITH INTEREST GRAPH INFORMATION - A method includes determining whether a social interaction between a first user and a second user includes a shared interest, where the shared interest identifies an interest about which the first user and the second user communicate in the social interaction, identifying a social relationship between the first user and the second user based at least on the social interaction, when the social interaction includes a shared interest, and associating the shared interest with the identified social relationship by referencing the shared interest in the identified social relationship between the first user and the second user. | 2017-02-09 |
20170039279 | LOADING DATA FROM A NETWORK SOURCE IN A DATABASE SYSTEM USING APPLICATION DOMAIN LOGIC CORESIDING WITH THE NETWORK INTERFACE - A system for executing database queries comprises a computer system including at least one computer processor and one network interface component. The computer processor is configured to determine that at least a portion of data requested by a query is remote data stored at a remote network source. The network interface component of the computing system retrieves the remote data from the remote network source. The retrieved remote data is pre-processed using application domain logic coresiding with the network interface component to generate a result set based on one or more parameters of the query and the query result is returned to the computer processor. The application domain logic may be implemented in a graphics processor unit (GPU), a field-programmable gate array (FPGA), or an application specific integrated circuit (ASIC). | 2017-02-09 |
20170039280 | RETRIEVING AND DISPLAYING DATA FROM A COLUMNAR DATABASE - A query is made at a computing device for generating a result-set. The result-set may comprise data selected from a database in response to the query. One or more cursors is associated with the result-set received in response to the query. The result-set is retrieved based on the one or more cursors. In one embodiment, the result-set may be retrieved in a columnar fashion. | 2017-02-09 |
20170039281 | TECHNIQUES FOR SEMANTIC SEARCHING - Techniques are disclosed for querying, retrieval, and presentation of data. A data analytic system can enable a user to provide input, through a device to query data. The data analytic system can identify the semantic meaning of the input and perform a query based on the semantic meaning. The data analytic system can crawl multiple different sources to determine a logical mapping of data for the index. The index may include one or more subject areas, terms defining those subject areas, and attributes for those terms. The index may enable the data analytic system to perform techniques for matching terms in the query to determine a semantic meaning of the query. The data analytic system can determine a visual representation best suited for displaying results of a query determined by semantic analysis of an input string by a user. | 2017-02-09 |
20170039282 | FLEXIBLE AUTHENTICATION FRAMEWORK - A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety of sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be received at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries. | 2017-02-09 |
20170039283 | Searching Based on the Persona of Another - An efficient computer-implemented technique is described herein for allowing a searcher to access result items by taking into account the perspective of a beneficiary entity. In some cases, the beneficiary entity may correspond to another person besides the searcher who submits a query, on whose behalf the searcher is performing the search. The technique operates by leveraging the activity of a group of relevant users who have a similar demographic profile to the beneficiary entity, with respect to a topic of the query under consideration. | 2017-02-09 |
20170039284 | LOADING DATA FROM A NETWORK SOURCE IN A DATABASE SYSTEM USING APPLICATION DOMAIN LOGIC CORESIDING WITH THE NETWORK INTERFACE - A system for executing database queries comprises a computer system including at least one computer processor and one network interface component. The computer processor is configured to determine that at least a portion of data requested by a query is remote data stored at a remote network source. The network interface component of the computing system retrieves the remote data from the remote network source. The retrieved remote data is pre-processed using application domain logic coresiding with the network interface component to generate a result set based on one or more parameters of the query and the query result is returned to the computer processor. The application domain logic may be implemented in a graphics processor unit (GPU), a field-programmable gate array (FPGA), or an application specific integrated circuit (ASIC). | 2017-02-09 |
20170039285 | ADAPTIVE USER INTERFACE FOR REAL-TIME SEARCH RELEVANCE FEEDBACK - A method and apparatus for dynamically adjusting the user interface of a search engine in order to effectively communicate the improved relevancy achieved through real-time implicit re-ranking of search results is described. Real-time implicit re-ranking occurs without delay after every user action as the search is being conducted, so finding methods of immediately altering the search page without disrupting the user experience is important. Graphical icons next to search results are employed to enable generating and removing re-ranked results, referred to as “recommended” search results. Clusters based on the real-time user model are also displayed to facilitate query reformulations. Sponsored links are selected using the real-time user model along with a combination of RPC and CTR information and are displayed in a manner similar to the organic results, or used to replace the initial sponsored links altogether. | 2017-02-09 |
20170039286 | Integrated data mining system architecture for extraction, processing and consumption of user data for customizing search engine output and other applications - The present invention discloses several embodiments of data mining architectures. Data mining architectures have components such as secure cloud servers hosting data warehouses, data modelers, analytics engines, and query engines. Systems comprising such data mining architecture process data extracted from user submitted data files in several formats, which could be massive datasets spread across multiple dimensions. Query engines have Application Programming Interfaces to communicate with external databases and services. Also disclosed are architectures and methods of accessing external databases that are located behind firewalls or have other security and privacy protections to mine additional data based on data from user submitted data files. The present invention can be used for applications such as customizing search engine output. | 2017-02-09 |
20170039287 | METHOD OF TRANSFORMING A 2D MOBILE SEARCH APP INTO A 3D MOBILE SEARCH APP - An existing two-dimensional search engine app (“2D Search App”) is transformed into a search engine that can present three-dimensional results (“3D Search App”), allowing the presentation of 3D sites and objects on a mobile device through a mobile App in communication with a central server. The client is capable of performing 3D rendering in accordance with the instructions received from the server. The client also interacts with the server to send and retrieve other data, including requests, instructions and text, images or video. The server is capable of converting 3D models into instructions which can be sent to the client, thereby allowing the client to reproduce the 3D model in the mobile device for viewing. The invention finds application in a wide range of fields, including fashion, retail outlets, and product demonstration and sales. | 2017-02-09 |
20170039288 | Content Placement Criteria Expansion - Systems and methods of providing information via a computer network are provided. A data processing system can identify a cluster that includes a plurality of online content items having a semantic or user similarity. The data processing system determines a plurality of cluster placement criteria of the cluster, and receives content configured for display with a web page. The content can be associated with the cluster based on the semantic or user similarity. A cluster placement criterion of the plurality of cluster placement criteria can be selected based on a quality metric of the selected cluster placement criterion, and the selected cluster placement criterion can be provided as a supplemental criterion used to select the content for display with the web page. | 2017-02-09 |
20170039289 | DISAMBIGUATION OF ONLINE SOCIAL MENTIONS - The technology disclosed relates to identifying entity reflections that refer to a same real-world entity. In particular, it relates to using statistical functions to make probabilistic deductions about entity attributes, which are used to construct optimal combinations of entity attributes. These optimal combinations of entity attributes are further used to generate search queries that return more precise search results with greater recall. | 2017-02-09 |