| 18th week of 2016 patent applcation highlights part 50 |
| Patent application number | Title | Published |
|---|
| 20160125001 | AUTOMATIC SCREEN GENERATION DEVICE, AUTOMATIC SCREEN GENERATION PROGRAM, AND AUTOMATIC SCREEN GENERATION METHOD - According to a conventional method, there is only one kind of a database access screen pattern (single sheet format), the screen layout cannot be changed from one user to another, a portion that produces an output to a database needs to make an external program call, and, there is no user-by-user utilization right which is generally required for a database access screen, not is there a function provided for transitioning from database access screen A to database access screen B involving value transfer. The present invention is provided with two kinds of screen patterns of a single sheet format and a list format, eliminates the need for a programming language and a database operation language, and is further provided with user-by-user utilization right and a function for transitioning from data access screen A to data access screen involving value transfer on the basis of a setting made by a setting person without requiring programming. Further, in accordance with a setting content by the setting person is stored, and a database access screen corresponding to a utilization mode is automatically generated in accordance with the setting content selected by the user and a screen program. | 2016-05-05 |
| 20160125002 | METHOD AND SYSTEM FOR MANAGING RECENT DATA IN A MOBILE DEVICE LINKED TO AN ON-DEMAND SERVICE - Systems and methods for managing recent data items in a database. A method typically includes determining whether a data object managed by an on demand service is designated as able to be accessed by a user at a mobile device and storing locally at a mobile device a plurality of most recently used items viewed for a data object designated as able to be accessed by a user at a mobile device. The method also typically includes determining a single most recently used set from among the stored plurality of most recently used items viewed for at least one data object designated as able to be accessed by a user at a mobile device. | 2016-05-05 |
| 20160125003 | SECONDARY QUEUE FOR INDEX PROCESS - An index server may be configured to collect content associated with an entity, and process the content for indexing at a primary index queue. At least one portion of the content may be marked for exclusion from the primary index queue, and the marked content may be transferred to a secondary index queue to be processed for indexing. A comprehensive index may be stored based on the processing performed at the primary and secondary index queues such that the content associated with the entity is wholly represented by indexed content. If the secondary index queue is disabled, automatically or in response to a request from the entity, the content processed for indexing at the primary index queue may be stored in an index excluding the marked content. In some examples, the comprehensive index and/or the index with excluded marked content may be provided to a compliance server for analysis. | 2016-05-05 |
| 20160125004 | METHOD OF INDEX RECOMMENDATION FOR NOSQL DATABASE - In one embodiment, a method for indexing a document database includes determining, according to user's access status on a plurality of documents in the document database, index indicators from attributes of respective fields of the plurality of documents, wherein the index indicators are used for indexing the plurality of documents, dividing the plurality of documents into a plurality of document sets, indexing the plurality of document sets according to the index indicators. The method may include dividing a plurality of documents in a document database into document sets by utilizing an attribute that a document database is easy to be divided into chunks, and may effectively implement indexing of the document database for the document sets according to another embodiment. | 2016-05-05 |
| 20160125005 | Apparatus and Method for Profiling Activities and Transitions - A method and apparatus for generating a structured profile of activities and transitions is provided. The method includes receiving data related to a plurality of activities and a plurality of transitions, wherein each of the plurality of transitions is a path between a pair of activities among the plurality of activities, storing the data related to the plurality of activities and the plurality of transitions into the storage device, reducing a dimension of the data by indexing the data using state variables, generating a plurality of nodes, wherein each of the plurality of nodes corresponds to each of the plurality of activities, generating a plurality of links, wherein each of the plurality of links corresponds to each of the plurality of transitions, and storing the plurality of nodes and the plurality of links as the structured profile at the storage device. | 2016-05-05 |
| 20160125006 | INDEXING CONTENT AND SOURCE CODE OF A SOFTWARE APPLICATION - In a method for generating a searchable index from an analysis of a software application, receiving a first software application. The one or more processors determine that a first source code of the first software application is inaccessible. The one or more processors stimulate the first software application. The one or more processors analyze textual data resulting from the stimulation of the first software application. The one or more processors classify one or more images resulting from the stimulation of the first software application. The one or more processors index the analyzed textual data and the classified one or more images resulting from the stimulation of the first software application. | 2016-05-05 |
| 20160125007 | METHOD OF FINDING COMMON SUBSEQUENCES IN A SET OF TWO OR MORE COMPONENT SEQUENCES - A method of finding common subsequences in a set of two or more component sequences. The method includes obtaining two or more component sequences and identifying the location(s) of one or more distinct items that occur at least once within each of the two or more component sequences. The method also includes placing the location(s) within each component sequence of each commonly-occurring distinct item in a location n-tuple and storing each location n-tuple in a location n-tuple container. The method further includes sorting the entries in the location n-tuple container and placing each of the location n-tuples in the location n-tuple container into a tier in a tier set. The method additionally includes obtaining any desired information regarding common subsequences. | 2016-05-05 |
| 20160125008 | PRIORITY QUEUE HAVING ARRAY AND TREES - A replace operation is performed in relation to a priority queue. The priority queue has trees and elements. A first element stores a value having a greatest priority of any value stored in any element and in any tree. Each tree corresponds to one of the elements. | 2016-05-05 |
| 20160125009 | PARALLELIZED EXECUTION OF WINDOW OPERATOR - A window operator can be processed according to a variety of techniques that introduce parallelism. Window function sub-results can be calculated separately on different nodes. Overall superior performance can result. Skewness in input data can be accounted for by controlling a degree of parallelism at nodes. | 2016-05-05 |
| 20160125010 | METHOD OF TRACKING THE DISTRIBUTION OF INFORMATION - A method of tracking the distribution of information, the method comprising: providing to a first user a first token comprising a first unique identifier and a first address; storing in a first database table a link between the first user and the first token; receiving at the first address a request from a second user, the request being made using the first token which has been received by the second user from the first user; storing in a second database table a link between the first token and the second user; providing to the second user a second token comprising a second unique identifier and a second address in response to the request; and storing in a third database table a link between the second token and the second user. | 2016-05-05 |
| 20160125011 | SYSTEMS, METHODS, AND APPARATUSES FOR POPULATING A TABLE HAVING NULL VALUES USING A PREDICTIVE QUERY INTERFACE - Disclosed herein are systems and methods for populating a table having null values using a predictive query interface including means for receiving a tabular dataset from a user as input, the tabular dataset having data values organized as columns and rows; identifying a plurality of null values within the tabular dataset, the null values being dispersed across multiple rows and multiple columns of the tabular dataset; generating indices from the tabular dataset of columns and rows, the indices representing probabilistic relationships between the rows and the columns of the tabular dataset; displaying the tabular dataset as output to the user, the displayed output including the data values depicted as known values and the null values depicted as unknown values; receiving input from the user to populate at least a portion of the unknown values within the displayed tabular dataset with predicted values; querying the indices for the predicted values; and displaying the predicted values as updated output to the user. Other related embodiments are further disclosed | 2016-05-05 |
| 20160125012 | DATA CACHE ARCHITECTURE - A computing platform may receive data identifying one or more sets of fields of a database. The computing platform may, for each record of a plurality of records of the database, instantiate one or more objects corresponding to the one or more sets and comprising values stored in the fields for the record, and may store, amongst a plurality of objects associated with the database, the one or more objects. In some embodiments, the computing platform may instantiate: an object for the record; for each set of the one or more sets, an object for the set; and for each field of the set, an object for the field. | 2016-05-05 |
| 20160125013 | EVALUATING PASSAGES IN A QUESTION ANSWERING COMPUTER SYSTEM - According to an aspect, a processing system of a question answering computer system determines a first set of relations between one or more pairs of terms in a question. The processing system also determines a second set of relations between one or more pairs of terms in a candidate passage including a candidate answer to the question. The processing system matches the first set of relations to the second set of relations. A plurality of scores is determined by the processing system based on the matching. The processing system aggregates the scores to produce an answer score indicative of a level of support that the candidate answer correctly answers the question. | 2016-05-05 |
| 20160125014 | REGISTERING DATA MODIFICATION LISTENER IN A DATA-GRID - A node including a memory to store data of the node and a processor coupled to the memory. The processor can receive, from a listener in a data grid system, a filter defined by search criteria of a search query. The processor can also communicate, to the listener, data from the memory that is filtered using the filter. The processor can further identify changes to the filtered data. The processor can further record, into a queue, the changes to the filtered data in the memory after the filtered data is communicated to the listener. The processor can further communicate, to the listener, the queue of changes to the filtered data. | 2016-05-05 |
| 20160125015 | DATABASE DATA DISTRIBUTION MANAGEMENT - The maintaining of a database that is distributed across a front database and one or more cloud databases. Rather than have the front and remote portions of the database be fixed, a data distribution manager evaluates databases segments following a data distribution policy to identify one or more database segments that are to be transferred to or from the one or more cloud databases from or to the front database. In response, the data distribution manager causes the identified database segment to be moved. Accordingly, the data that is in the front database (and the data that is stored in the cloud) may vary over time. | 2016-05-05 |
| 20160125016 | MAINTAINING STORAGE PROFILE CONSISTENCY IN A CLUSTER HAVING LOCAL AND SHARED STORAGE - A per device state is introduced that indicates whether a storage device is shared clusterwide or not. The state may be populated by default based on detected device locality. Devices detected as local and those shared by only a subset of host machines in a cluster of machines may have the state set to “FALSE.” Devices which are shared by all the machines in a cluster may have the state set to “TRUE.” Locality of storage devices in a cluster may be modified using such state information. Operations upon other storage device state may be modified depending upon device sharing state. | 2016-05-05 |
| 20160125017 | DETECTION OF DATA REPLICATION CONSISTENCY - A method, system, and computer program product for detecting consistency between first and second data replicas is provided. Detecting consistency between data replicas includes acquiring first characteristic information of a first data replica and second characteristic information of a second data replica, the first and second characteristic information being associated with keys of the respective first and second data replicas. Detecting consistency between data replicas further include determining, based on a predetermined threshold value of a number of determination times, whether the first characteristic information is identical to the second characteristic information of the second data replica. In response to the determining that the first characteristic information and the second characteristic information are identical, whether the first data replica is consistent with the second data replica may then be confirmed. | 2016-05-05 |
| 20160125018 | DATABASE MANAGEMENT SYSTEM AND METHOD - A database management system generates a log each transaction during execution of a plurality of transactions and stores the generated logs in log storage areas. The database management system records sequence numbers of logs at least in the generated logs of transactions belonging to a set of transactions of which results are different depending on a transaction execution order. | 2016-05-05 |
| 20160125019 | APPARATUS AND METHOD FOR PROCESSING A QUERY - Apparatus and method for processing a query. The apparatus includes: a storage unit configured to store (i) a plurality of safe elements committed and saved in the database, and (ii) a plurality of unsafe elements for updating the plurality of safe elements, wherein the unsafe elements are not committed or committed, but not saved; a first query executing unit configured to execute the query on the plurality of unsafe elements; a second query executing unit configured to execute the query on the plurality of safe elements after the first query executing unit executes the query; and a third query executing unit configured to execute the query on at least one safe element saved during execution of the query by the second query executing unit after the second query executing unit executes the query. There is also provided another apparatus and a method. | 2016-05-05 |
| 20160125020 | SYSTEMS AND METHODS FOR MANAGING CONTACT INFORMATION - Systems and methods for managing and presenting contact information to users of display terminals are presented herein. In some embodiments, the method includes receiving a request to display contact information associated with a contact stored in an address book associated with a first user, wherein the stored contact information includes a plurality of address entries, and displaying at least some of the plurality of address entries for the contact, wherein at least one displayed address entry is visually distinguishable from at least one other displayed entry for the contact based on a recentness score associated with each of the plurality of address entries. | 2016-05-05 |
| 20160125021 | EFFICIENT UPDATES IN NON-CLUSTERED COLUMN STORES - The processing of transaction oriented data tends to be row-oriented, while the processing of analytical operations tends to be column-oriented. Various systems, sometimes referred to as operational data warehouses, may comprise mechanisms adapted for use in scenarios where both transactional data processing and analytical queries are to be performed efficiently. The operational data warehouse (ODW) may perform and update data efficiently by maintaining a table in structures comprising a column store, a delta store, a delete bitmap, and a delete buffer. In this environment, key values may be associated for each row such that the ODW may more efficiently seek rows. Further, rows may also be excluded from a column store based at least in part on a filter criterion. The filtering criterion may be used to filter out rows based on a created predicate set by a user or the system. | 2016-05-05 |
| 20160125022 | EFFICIENT MAINTENANCE OF COLUMN STORE INDEXES ON MEMORY-OPTIMIZED TABLES - Techniques for improved update performance in transactional and data warehouse applications are disclosed herein. A request to store a modified version of the row is received. A first record indicative of a logically deleted state for values in the column store corresponding to the row is added to a first plurality of records. The modified version of the row is added to the row store. The identifier is modified to indicate that the column store does not contain a location corresponding to the modified version of the row. A second record indicative of the modified version of the row not having been propagated to the column is added to a second plurality of records store. | 2016-05-05 |
| 20160125023 | DERIVED TABLE JOIN PROCESSING - Systems and methods for processing tables for query operations referencing the tables are described. A method may include determining whether a table is referenced one time or more than one time in a query that includes at least one operation referencing the table. The method may further include creating a single materialized view of the table when the table is determined to be referenced more than one time in the query. The method may also include creating two or more hash tables based, at least in part, on the single materialized view of the table by creating a hash table for each operator in the query that references the table, and evaluating the query using the two or more hash tables. | 2016-05-05 |
| 20160125024 | PRODUCT NAVIGATOR - A system for a product navigator is provided. The system receives a search string at a business-type classification interface on an interactive user display. A search type associated with the search string may be determined based on a search type selection from a plurality of search types. A search of a database may be initiated for an entry matching the search string according to the search type, where the entry has corresponding business-type classification data including a brief classification description, an extended classification description, and an associated classification code. The brief classification description and the extended classification description may be output on the interactive user display based on receiving the corresponding business-type classification data from the database. A confirmation request may be presented on the interactive user display and a classification code field populated with the associated classification code based on receiving an affirmative response to the confirmation request. | 2016-05-05 |
| 20160125025 | MOST LIKELY CLASSIFICATION CODE - A system for determining a most likely classification code is provided. The system includes a processing device and a memory device in communication with the processing device. The memory device stores instructions that when executed by the processing device may result in receiving a geographic location indicator associated with a plurality of geographic location-based rules stored in a database. A business-type classification selection can also be received. The database may be queried to retrieve a data set from the plurality of geographic location-based rules that matches the geographic location indicator and the business-type classification selection. The data set may be received in response to querying the database and can be formatted as a list including one or more entries. Each of the entries may include a numeric classification code and a corresponding description. The list may be output as selectable instances of the one or more entries. | 2016-05-05 |
| 20160125026 | PROACTIVE QUERY MIGRATION TO PREVENT FAILURES - An example method of processing a federated query includes receiving a first federated query from a first client and receiving a second federated query from a second client. The first federated query includes a first source query that is in accordance with a target data source's query model, and the second federated query includes a second source query. The method also includes sending the second source query to the target data source and determining whether the second source query has failed at the target data source. The method further includes in response to determining that the second source query has failed, migrating the second source query in accordance with the first source query. | 2016-05-05 |
| 20160125027 | SEARCH SYSTEM, SEARCH PROGRAM, AND SEARCH-CONDITION INPUT METHOD - A search system with which a user can carry out an easy and quick operation by specifying a plurality of keywords by touch operations. The search system includes a keyword extracting unit that extracts an option of a keyword and displays the option in a list on the touch panel, and a search-condition setting unit that sets a search condition based on an operation of the user with respect to the option of the keyword. When a first keyword is selected by a touch operation from the option of the keyword, if the user slides a touch position on the touch panel, the search-condition setting unit sets the search condition depending on a direction of the slide on an assumption that a search operator of AND or OR is specified between the first keyword and a second keyword further selected by the user thereafter. | 2016-05-05 |
| 20160125028 | SYSTEMS AND METHODS FOR QUERY REWRITING - Systems and methods for rewriting query terms are disclosed. The system collects queries and query session data and separates the queries into sequences of queries having common sessions. The sequences of queries are then input into a deep learning network to build a multidimensional word vector in which related terms are nearer one another than unrelated terms. An input query is then received and the system matches the input query in the multidimensional word vector and rewrites the query using the nearest neighbors to the term of the input query. | 2016-05-05 |
| 20160125029 | INTELLIGENT CACHING FOR ENTERPRISE RESOURCE PLANNING REPORTING - This disclosure describes systems, methods, and apparatus for ERP reporting using a cache server to cache previous query results. Query latency is further reduced by routing queries and responses to queries through the cache server rather than via direct communication between a querying device and a server hosting the database. This is done by moving a driver for interfacing with the database to the server hosting the database, thus avoiding slow protocol communications between this driver and the database when such communications occur over a WAN. A custom driver is also designed to interface with the cache server and control routing of queries and responses through the cache server. Further, a cache server is selected that enables queries to be passed straight to the server hosting the database rather than the query device having to pass these queries to the database. | 2016-05-05 |
| 20160125030 | SYSTEM, METHOD AND RECORDING MEDIUM - A system includes a primary control device configured to control access to a first database and a secondary control device which is a standby device of the primary control device and is configured to control access to a second database. The secondary control device is configured to: receive first access prescribing information which prescribes processing for accessing the first database, and an inquiry statement to the first database from the primary control device; store the received first access prescribing information as a second access prescribing information and the inquiry statement in a first memory of the secondary control device; and erase the second access prescribing information, which is stored in the first memory and is used for the secondary control device to access the second database, when a notification of releasing a connection is received from the primary control device, the connection being used for accessing the first database. | 2016-05-05 |
| 20160125031 | METHOD AND APPARATUS FOR RETRIEVING AND ORGANIZING PHYSICAL ADDRESSES - A method and apparatus for retrieving and organizing geographical address information. Each physical address is assigned a unique code including symbols and alphanumeric characters. This unique code is the electronic address assigned to each physical address. Certain of the electronic addresses and the corresponding physical addresses are assigned aliases. The electronic addresses are assigned on a semi-permanent basis (i.e., the electronic addresses are not changed unless there is change to the physical location); whereas the aliases can be freely changed and reassigned among the electronic addresses. | 2016-05-05 |
| 20160125032 | PARTITION-AWARE DISTRIBUTED EXECUTION OF WINDOW OPERATOR - Partition-aware calculation of a window operator can be supported. Different nodes can calculate window function sub-results on database partitions locally, in parallel and independently. Recognition of scenarios in which such parallelism is permissible can be performed. Overall superior performance can result. | 2016-05-05 |
| 20160125033 | STREAM DATA PROCESSING METHOD WITH TIME ADJUSTMENT - Some stream data (e.g., sensor streams) has characteristics in which data is periodically sent to a stream data processing server. When data arrives periodically, to hold a certain period is the same as to hold a certain amount. Example implementations described herein are directed to replacing the range window, which holds a period of stream data, with a row window which holds an amount of stream data. In the same manner, the example implementations replace the range rstream, which outputs results every period, with a row rstream which outputs results for every amount. | 2016-05-05 |
| 20160125034 | Annotate Apps with Entities by Fusing Heterogeneous Signals - A system and method of annotating an application, including obtaining input signals associated with a target application, wherein the input signals are obtained from a plurality of sources, obtaining first annotation data from the obtained input signals, generating second annotation data in a machine-understandable form based on the first annotation data, and associating the second annotation data with the target application. | 2016-05-05 |
| 20160125035 | CONTEXTUAL SEARCH INPUT FROM ADVISORS - Embodiments of the invention comprise systems, computer program products, and methods for providing a contextual search tool to a user. The contextual search tool receives a search from the user and provides search results, content, and dynamic contextual information (e.g., dynamic contextual questions, user information, and account information) to the user. The contextual search tool then receives contextual information input from the user with an indication that the user would like to communicate with an advisor, and a communication channel is opened between the user and the advisor. The advisor has access the user's search and provides contextual information input, which allows the contextual search tool to update the search results and the dynamic contextual information. As such, the invention of the present invention improves the ability of the contextual search tool to provide tailored, customized, and relevant search results to the user based in part on advisor input. | 2016-05-05 |
| 20160125036 | LINKING CUSTOMER PROFILES WITH HOUSEHOLD PROFILES - Embodiments of the invention comprise systems, computer program products, and methods for generating a response to a user search. User input is received to create a household profile, wherein the household profile comprises information related to the members of the household. The user also provides a search for information in which the user may be interested. The household profiles may be utilized along with the search, and with other information, such as user profile information, account information, or dynamic contextual questions to provide search results or updated search results, and dynamic contextual information or updated dynamic contextual information for tailoring the search results to the user. The user may select which households, which individuals in the households, and/or information about the individuals to use in the search. As such, the search results for the user may be more tailored to the results in which the user is interested. | 2016-05-05 |
| 20160125037 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, INFORMATION PROCESSING PROGRAM, AND STORAGE MEDIUM - A support apparatus for generating a project including data to be used in a controller allows a user to easily retrieve target data for editing or for other processing. A support apparatus retrieves a target group name matching an input character from the names of hierarchically managed groups into which data has been classified, and displays the retrieved target group name together with the name of a parent group for the group with the retrieved target group name. | 2016-05-05 |
| 20160125038 | SYSTEMS AND METHODS FOR ENTERPRISE DATA SEARCH AND ANALYSIS - A system and method for enterprise searching of documents. The system comprises a computing system configured to receive one or more search terms, and responsively analyze a group of documents to return analysis results. A method for enterprise searching includes indexing the group of documents, determining relevant terms and measuring the context between terms. Relevant portions of documents, also called passages of interest, are determined as part of the analysis process. The analysis includes analyzing the passages of interest for words, repeating term sequences, non-consecutive repeating root term sequences, and non-word terms. The terms/sequences are scored and sorted, resulting in a set of high-importance items, allowing a user to quickly subselect search results without reading through the results. | 2016-05-05 |
| 20160125039 | Data mining method and apparatus, and computer program product for carrying out the method - A distributed data mining method to be carried out in user equipments connected to a peer-to-peer communication network. The method includes: providing a data mining frame application in the equipments as code running on a device-specific platform and a trainable data mining algorithm produced on a programming language common to all equipments, running the data mining algorithm in a first equipment to process user data stored therein, modifying the data structures and/or the input parameter set of the data mining algorithm through training, forwarding at least a part of the modified input parameter set and/or the modified data structures of the data mining algorithm as training information from the first equipment to at least one second equipment, and modifying the input parameter set and/or the data structures of the data mining algorithm running on at least one second equipment using the training information received from the first equipment. | 2016-05-05 |
| 20160125040 | DIGITAL CURRENCY MINING CIRCUITRY HAVING SHARED PROCESSING LOGIC - An integrated circuit may be provided with cryptocurrency mining capabilities. The integrated circuit may include control circuitry and a number of processing cores that complete a Secure Hash Algorithm 256 (SHA-256) function in parallel. Logic circuitry may be shared between multiple processing cores. Each processing core may perform sequential rounds of cryptographic hashing operations based on a hash input and message word inputs. The control circuitry may control the processing cores to complete the SHA-256 function over different search spaces. The shared logic circuitry may perform a subset of the sequential rounds for multiple processing cores. If desired, the shared logic circuitry may generate message word inputs for some of the sequential rounds across multiple processing cores. By sharing logic circuitry across cores, chip area consumption and power efficiency may be improved relative to scenarios where the cores are formed using only dedicated logic. | 2016-05-05 |
| 20160125041 | GENERATING SEGMENTS BASED ON INTELLIGENT SEQUENTIAL DATA - The present disclosure is directed toward systems and methods that allow users to efficiently and effectively create and identify segments of usage patterns. For example, systems and methods described herein allow marketers to query and return sequential segments including sequence conditions based on user-defined dimension item values. Furthermore, systems and methods described allow marketers to query and return sequential segments including sequential events based on user-defined dimension variables. In addition to the foregoing, systems and methods described herein allow marketers to query and return sequential segments defined by repeated events performed at given regularity or frequency. | 2016-05-05 |
| 20160125042 | USING AN APPLICATION PROGRAMMING INTERFACE (API) DATA STRUCTURE IN RECOMMENDING AN API COMPOSITE - An application programming interface (API) exploration data structure is used in presenting an API composite to a first entity. A query associated with a topic is received from the first entity. A portion of the data structure is accessed. The accessed portion includes nodes that represent entities, nodes that represent APIs, and edges that represent relationships between nodes. A similarity score is calculated for each entity using a comparison to the first entity. Each similarity score is then compared to a threshold. A first network including each entity that has a similarity score above the threshold is generated. An API group including each API that has a relationship with the first network is generated. The API composite is identified based on the topic. As identified, the API composite includes an API of the related API group. The API composite is presented to the first entity. | 2016-05-05 |
| 20160125043 | CONTEXTUAL SEARCH TOOL - Embodiments of the invention comprise systems, computer program products, and methods for providing a contextual search tool to a user. The contextual search tool receives a search from the user and provides search results, content, and dynamic contextual information (e.g., dynamic contextual questions, user information, and account information) to the user. The contextual search tool then receives contextual information input from the user (input for the dynamic contextual information, selection of the search results, or the like) and updates the search results and the dynamic contextual information. As such, the invention of the present invention improves the ability of the contextual search tool to provide tailored, customized, and relevant search results to the user based not only on the search terms provided by the user, but based on dynamic contextual information that changes as the user takes actions within the contextual search interface. | 2016-05-05 |
| 20160125044 | Automatic Data Display Selection - Various implementations described herein are directed to a non-transitory computer readable medium having stored thereon computer-executable instructions which, when executed by a computer, may cause the computer to receive a number of display fields. The computer may retrieve a list of data types that correspond to marine electronics. The computer may also fill the number of display fields on a display with data corresponding to the list of data types. Data may only displayed if a sensor transmitting the data is detected on a network. | 2016-05-05 |
| 20160125045 | INFORMATION PROVISION METHOD - An information provision method includes accumulating, in a first database, a first identifier identifying each of one or more service providers, and first device information indicating an electrical device to be designated by each of the one or more service providers in association with each other; accumulating, in a second database, a second identifier identifying each of one or more users, and second device information indicating an electrical device to be used by the one or more users in association with each other; extracting a service provider associated with the first device information when the second device information is updated by addition of a new electrical device to be used by one of the one or more users, and when the new electrical device is included in the electrical devices indicated by the first device information. | 2016-05-05 |
| 20160125046 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND STORAGE MEDIUM - This information processing device has: a question presentation unit which obtains at least one piece of question information from a question information storage means, in which pieces of question information are stored, and presents the piece of information; an answer reception unit which receives an answer to the presented question information; and a suitability calculation unit which converts the received answer into a first index value, which indicates the suitability of a coloration scheme to the answer, and calculates the suitability of each of a plurality of prepared coloration schemes on the basis of the first index value. | 2016-05-05 |
| 20160125047 | Search Recommendation Method and Apparatus - Provided are a method and a device for search recommendations, said method comprising: reception of a search term; acquisition of a plurality of search results related to the search term, and acquisition from a knowledge bank of at least one content item related to the search term; acquisition of at least one recommended result on the basis of the search term and the at least one content item, and provision of a search page; the search page comprises a first display part and a second display part, a plurality of search results being displayed in the first display part, and at least one recommended result being displayed in the second display part. While providing users with search results, the method of the embodiments of the present invention also helps users get a grasp of comprehensive information related to the type of the search term used, thus providing more information relating to the intention of the search and satisfying user requirements while enhancing the user experience. | 2016-05-05 |
| 20160125048 | ITEM RECOMMENDATION DEVICE, ITEM RECOMMENDATION METHOD, AND COMPUTER PROGRAM PRODUCT - An item recommendation device includes a context information generator and a ranker. The context information generator generates and outputs context information including user intention by performing semantic analysis on a natural language request which is input. The ranker ranks candidates of items to be presented to a user based on the context information, user information representing an attribute of the user, and history information representing item usage history of the user. | 2016-05-05 |
| 20160125049 | System and method for reporting multiple objects in enterprise content management - Systems and methods for multi-object reporting in a content management system. A report type definition may define which objects are involved and how they are related. A report execution engine may generate a multi-object query language statement to translate the report type definition into query language. A query language execution engine may break the query language statement down into separate single pieces. A cost optimization engine may determine if it is cost efficient to join the objects. An indexed access execution engine may extract unique IDs of the objects and join the unique IDs to generate an index. A Lucene based search engine may be accessed according to the index, and the response is post processed to generate a multi-object report. | 2016-05-05 |
| 20160125050 | SYSTEM AND METHOD FOR GENERATING SEARCH REPORTS - The present disclosure provides system and method for searching and analyzing information from a database based on a plurality of subject features. The system generates a list of relevant search results in a particular order and provides relevant excerpts from each of the search results in relation to each of the subject features, along with the association that represents the overlap between searched excerpt and the corresponding subject feature. The system may include a search report generator device that comprises a search module, a feature generation module, an analysis module, a ranking module, and a report generation module. | 2016-05-05 |
| 20160125051 | SYSTEM AND METHOD FOR DYNAMICALLY RETRIEVING DATA SPECIFIC TO A REGION OF A LAYER - A system may provide for retrieving data within a selected region of a map is provided. The system may include mobile devices configured to display a map and to receive a user selection of a region of the map. An application server may receive data from the mobile device, representing the user selected region of the map and a search criterion. A database may be in operative communication with the application server and executes a query using the data representing the selected region of the map and the search criterion and to return data results corresponding to a plurality of locations within the selected region and related to the search criterion. The mobile device may further be configured to display the data results corresponding to the plurality of locations on the selected region of the map and the displayed data results are automatically updated when the user moves the selected region of the map. | 2016-05-05 |
| 20160125052 | DATABASE VIRTUALIZATION - Frame data is received from an agent instrumented on a software component, the frame data describing a particular request from the software component to a database access component intercepted at the agent. The particular request corresponds to a transaction involving a database and the software component can interface with the database using the database access component. A service mode is identified that corresponds to the transaction and virtualization data is generated based on the service model and the particular request. The virtualization data is sent to the agent that describes a virtualized response to be provided by the agent to the software component as a response to the particular request. | 2016-05-05 |
| 20160125053 | SYSTEM AND METHOD FOR STORAGE AND ANALYSIS OF TIME-BASED DATA - A system and method includes a data sensor providing sensor data. A database is configured to store the sensor data over time in rows of a table. A processor is configured to convert the table into a temporal format and collapse the rows in a temporal table. The temporal data can be normalized, and the normalized temporal data can be natively analyzed over normalized time periods, e.g., to improve an efficiency and/or accuracy of the analysis. The systems and methods can also be used to efficiently inter-operate with non-temporal data as needed. | 2016-05-05 |
| 20160125054 | SCHEDULE DATA STANDARDIZATION - Systems, methods, and computer program products for processing schedule data for conversion to standardized schedule data. Non-standardized schedule data is determined from a schedule database. A plurality of schedule data points associated with the non-standardized schedule data are determined. Geographical coordinates for each of the schedule data points are determined. A plurality of standardized schedule data points that are associated with the non-standardized schedule data are determined based at least in part on the geographical coordinates of each of the schedule data points. The non-standardized schedule data is converted to the standardized schedule data for storage in a standardized schedule database based at least in part on the plurality of standardized data points. | 2016-05-05 |
| 20160125055 | OPTIMIZING DATA CONVERSION USING PATTERN FREQUENCY - Embodiments of the present invention provide systems and methods for increasing the efficiency of data conversion in a coprocessor by using the statistical occurrence of data patterns to convert frequently occurring data patterns in one conversion cycle. In one embodiment, a coprocessor system is disclosed containing a converter engine, which includes a parser and a converter, an input buffer, and a result store. The input buffer is configured to transfer a set of source data to the converter engine, which converts the source data from first code format to a second code format, and sends the converted source data to the result store. | 2016-05-05 |
| 20160125056 | VIRTUAL FUNCTION AS QUERY OPERATOR - A system includes definition of a remote data source, definition of a virtual function specifying executable job code, a return data format and a data location in the remote data source, reception of a structured language query including the virtual function as a data source, and, in response to the received query, instruction of the remote data source to execute the job code based on data in the data location and return data in the return data format. | 2016-05-05 |
| 20160125057 | IMPACT ANALYSIS - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for impact analysis. One of the methods includes receiving information about at least two logical datasets, the information identifying, for each logical dataset, a field in that logical dataset and format information about that field. The method includes receiving information about a transformation identifying a first logical dataset from which the transformation is to receive data and a second logical dataset to which the transformed data is provided. The method includes receiving one or more proposed changes to at least one of the fields. The method includes analyzing the proposed changes based on information about the transformation and information about the first logical dataset and the second logical dataset. The method includes calculating metrics of the proposed change based on the analysis. The method also includes storing information about the metrics. | 2016-05-05 |
| 20160125058 | NETWORK OPTIMIZED DEDUPLICATION OF VIRTUAL MACHINE SNAPSHOTS - Methods and systems for managing, storing, and serving data within a virtualized environment are described. In some embodiments, a data management system may manage the extraction and storage of virtual machine snapshots, provide near instantaneous restoration of a virtual machine or one or more files located on the virtual machine, and enable secondary workloads to directly use the data management system as a primary storage target to read or modify past versions of data. The data management system may allow a virtual machine snapshot of a virtual machine stored within the system to be directly mounted to enable substantially instantaneous virtual machine recovery of the virtual machine. | 2016-05-05 |
| 20160125059 | HYBRID CLOUD DATA MANAGEMENT SYSTEM - Methods and systems for managing, storing, and serving data within a virtualized environment are described. In some embodiments, a data management system may manage the extraction and storage of virtual machine snapshots, provide near instantaneous restoration of a virtual machine or one or more files located on the virtual machine, and enable secondary workloads to directly use the data management system as a primary storage target to read or modify past versions of data. The data management system may allow a virtual machine snapshot of a virtual machine stored within the system to be directly mounted to enable substantially instantaneous virtual machine recovery of the virtual machine. | 2016-05-05 |
| 20160125060 | ASYNCHRONOUS PROCESSING TIME METRICS - Asynchronous operations associated with a request such as threads, runnable elements, callable elements, and other invokable objects are tracked to determine the metrics about the request and operations. The present technology tracks the start and end of each asynchronous operation and maintains a counter which tracks the currently pending or executing asynchronous operations. By monitoring the request, the start and end of each asynchronous operation associated with the request, and the number of asynchronous operations currently executing, the present technology may identify the end of a request by identifying when the last asynchronous operation associated with the request ends. In some instances, the present technology identifies the end of a request when a counter which tracks the number of asynchronous operations executing reaches a value of zero after the first asynchronous operation has already begun. Tracking these operations allows the present technology to aggregate and report useful performance data about these requests. | 2016-05-05 |
| 20160125061 | SYSTEM AND METHOD FOR CONTENT SELECTION - A server and method for providing a content selection is provided. The server receives content targeting parameters and obtains content items from at least one content site based on the content targeting parameters. The server can further identify content descriptors for the content items and generate a first content cluster from a subset of the content items based on the content descriptors. The server can further generate a second content cluster from a second subset of the content items based on the content descriptors and rank the first and the second content clusters in an order of usefulness. The ranking of the content clusters can be based on at least one of an importance of content, a recentness of the content items and a size of the content cluster. | 2016-05-05 |
| 20160125062 | MULTI-SCALE TIMELING PHOTOGRAPH ALBUM MANAGEMENT WITH INCREMENTAL SPECTRAL PHOTOGRAPH CLUSTERING - Described embodiments utilize a multi-scale timeline approach in which photographs in a photograph album are organized into photograph clusters associated with multiple timeline scales. Each photograph cluster can be represented on a display screen as a thumbnail indicator in a photograph album window for efficient browsing. The thumbnail indicator can comprise one or more images automatically selected to represent a large number of photographs from the photograph cluster. Activation of one of the thumbnail indicators can trigger a change to another timeline scale. A multi-scale timeline one-step incremental spectral photograph clustering algorithm can also be utilized to quickly add or delete photographs from the cluster photographs at multiple timeline scales with a complexity approaching O(n). Near-duplicate photographs can also be automatically detected based on both time and visual features, and collapsed to a single representation to save space on the relatively small display screens typically included in mobile devices. | 2016-05-05 |
| 20160125063 | ANSWER MANAGEMENT IN A QUESTION-ANSWERING ENVIRONMENT - Managing answers in a question-answering environment is disclosed. Managing answers in the question-answering environment can include sorting, based on a set of answer categories for a subject matter, a first set of answers into a first answer category and a second set of answers into a second answer category. Managing answers in the question-answering environment can include determining, using the subject matter, a first category sequence including the first answer category and the second answer category, and establishing, based on the first category sequence, a first answer sequence established from a portion of the first set of answers from the first answer category and a portion of the second set of answers from the second answer category. | 2016-05-05 |
| 20160125064 | ANSWER CATEGORY DATA CLASSIFYING USING DYNAMIC THRESHOLDS - Managing confidence data in a question-answering environment is disclosed. Managing confidence data can include sorting, based on a set of answer categories for a subject matter, a first set of a plurality of answers into a first answer category. The first set can correspond to at least one of a third set of a plurality of confidence scores and the second set can correspond to at least one of a fourth set of the plurality of confidence scores. Managing confidence data can include classifying confidence scores of the third set into one of a plurality of confidence buckets using a first threshold and determining a fifth set of a plurality of thresholds using the plurality of confidence scores. Managing confidence data can include classifying unclassified confidence scores of the third set into one of the plurality of confidence buckets using the fifth set of the plurality of thresholds. | 2016-05-05 |
| 20160125065 | STORAGE MEDIUM, INFORMATION PRESENTATION METHOD, AND INFORMATION PRESENTATION APPARATUS - A non-transitory computer-readable storage medium stores a program that causes a computer to execute a process. The process includes obtaining data including multiple character strings that are separated from each other, identifying a first character string and second character strings in the obtained data, extracting third character strings indicating relationships between the first character string and the second character strings from character string collections stored in a database, selecting a character string collection from the character string collections based on proportions of the extracted third character strings included in the respective character string collections, and outputting information on the selected character string collection. Each of the character string collections includes character string sets each of which includes two character strings and a third character string indicating a relationship between the two character strings. | 2016-05-05 |
| 20160125066 | SYSTEMATIC AND ANALYTIC DATA SEGMENTATION - A system and method for analyzing a competitor's patent activity data is presented. The system may comprise one or more processors, a search module, a categorization module, a grouping module, and an analysis module, where each of the components of the system are communicating with one another in a networked system environment. The one or more processors may be in communication with a plurality of databases, where the plurality of databases include a patent database, a client database, and a competitor database. The competitor's activity data is compared to that of the client's to segment the competitor's activity and set priority to certain categories of the segmented competitor's activity data. The presented system monitors the competitor's patenting activity. | 2016-05-05 |
| 20160125067 | ENTITY RESOLUTION BETWEEN DATASETS - Embodiments relate to entity resolution. One aspect includes creating a deterministic model by defining an entity to be resolved, selecting two datasets for comparison, defining matching predicates for attributes of the datasets to select a set of candidate matches, and defining a precedence rule for the candidate matches to select a subset of the candidate matches. An aspect further includes running the deterministic model on the two datasets. Running the deterministic model includes applying the matching predicates and the precedence rule to data in the datasets that correspond to the attributes. An aspect also includes applying a cardinality rule to results of the running, and outputting the matching candidates for which the cardinality rule is satisfied. | 2016-05-05 |
| 20160125068 | SYSTEM AND METHOD FOR INTEGRATED MISSION CRITICAL ECOSYSTEM MANAGEMENT - The present approach provides methods and processes for comprehensive management of the Mission Critical Ecosystem. Mission critical information management includes information from an entity's facilities, especially the critical facilities. The methods and processes disclosed herein allow for assessing and managing dependencies between assets, which may provide valuable insight into, for example, risk relationships for planned and unplanned events, and mitigation planning and management for incidents. | 2016-05-05 |
| 20160125069 | DYNAMIC DATABASE OBJECT MANAGEMENT - Systems, methods, and computer program products for dynamically managing a travel object database that maintains one or more travel objects. A time limit request is received at a processing system for a record associated with one or more travel objects of the travel object database. A base time limit for a geographical identifier associated with the record is determined based at least in part on the geographical identifier by querying a time limit rules database based at least in part on the geographical identifier. The base time limit is adjusted based at least in part on the geographical identifier and at least one time adjustment rule to determine a geographical identifier time limit. A time limit for the record is determined based at least in part on the geographical identifier time limit to thereby transform the record and information thereof into a time limit for the travel objects associated with the record and maintained by the travel object database. | 2016-05-05 |
| 20160125070 | UNIFIED SYSTEM FOR REAL-TIME COORDINATION OF CONTENT-OBJECT ACTION ITEMS ACROSS DEVICES - Techniques disclosed herein can pertain to querying an object structure using an index to determine whether a content object of a specified type has been stored. Further, a request workflow can be evaluated in view of one or more exceptions. At least one action item can be generated based on a result of the query and the workflow evaluation. | 2016-05-05 |
| 20160125071 | DYNAMIC LOADING OF CONTEXTUAL ONTOLOGIES FOR PREDICTIVE TOUCH SCREEN TYPING - A system comprising a computer-readable storage medium storing at least one program and a computer-implemented method for generating a navigable user interface for the dynamic loading of contextual ontologies for predictive typing. In some embodiments, the method may include receiving an input from a client device, gathering context data corresponding to the input, and providing a predictive typing entry based on the context data and the received input, in a navigable user interface. | 2016-05-05 |
| 20160125072 | USER NAVIGATION IN A TARGET PORTAL - User navigation in a target portal with at least two portal pages. At least one query is created that includes uniform resource locators (URLs) of selected portal pages as search terms in a first search level; repeating until a certain abort criterion is reached: Receiving and analyzing search results of the at least one query including external websites containing search terms as part of their content; selecting a set of uniform resource locators from the received search results; creating a node in a graph-like-model for each selected URL if not already contained in the graph-like-model and associating the node with the selected uniform resource locator; creating and issuing a further search query including selected uniform resource locators of external websites in an additional search level; and in case the certain abort criterion is reached, performing a number of actions. | 2016-05-05 |
| 20160125073 | VISUALIZING CONFLICTS IN ONLINE MESSAGES - Visualizing social media conflict is provided. Active users in a set of human users authoring a number of textual messages regarding a particular topic more than a threshold number of textual messages are selected. Keywords are selected that occur more than a threshold number of times within the textual messages regarding the particular topic. A sentiment score is computed for each of the keywords occurring more than the threshold number of times within the textual messages using a keyword co-occurrence graph. A sentiment of each of the active users is determined based on the computed sentiment score of each of the selected keywords that are authored by a particular active user. Two distinct groups from the active users are selected based on at least one of a relationship between the two distinct groups and a determined degree of conflict between the two distinct groups with regard to the particular topic. | 2016-05-05 |
| 20160125074 | CUSTOMIZED CONTENT FOR SOCIAL BROWSING FLOW - Provided are techniques for providing customized content for social browsing flow. In response to accessing existing content, a group is identified from a plurality of groups created from behavioral and profile analysis. Additional content is created for the existing content to provide a customized browsing experience based on the identified group. The additional content is displayed with the existing content. | 2016-05-05 |
| 20160125075 | ANSWER INTERACTIONS IN A QUESTION-ANSWERING ENVIRONMENT - In a question-answering (QA) environment, a first answer sequence is identified. As identified, the first answer sequence includes a first answer and a second answer. A corpus is analyzed using the first answer and the second answer. Based on the analysis, a set of influence factors corresponding to both the first answer and the second answer are identified. A first answer relationship between the first answer and the second answer is then generated based on the set of influence factors. | 2016-05-05 |
| 20160125076 | MUSIC RECOMMENDATION SYSTEM FOR VEHICLE AND METHOD THEREOF - An automotive music recommendation system may include: a data collector that collects a plurality of musical data from social data kept in a social network; a data analyzer that checks keywords and music metadata by analyzing the musical data; a music manager that creates a matching table by matching the music metadata with the keywords; and a music recommender that checks a keyword according to driving state data by a driver from the matching table and creates a recommendation list using at least one piece of music metadata matched with the keyword. The automotive music recommendation system may recommend music to the driver in accordance with a driving condition on the basis of social data. | 2016-05-05 |
| 20160125077 | MUSIC RECOMMENDATION SYSTEM FOR VEHICLE AND METHOD THEREOF - An automotive music recommendation system includes: a communication unit that receives a music list including music content from a portable audio device by communicating with the portable audio device; an information detection unit that detects driving condition information when music content included in the music list is played or when a user of a vehicle requests a music recommendation; a music management unit that creates a matching table by matching the music list with the driving condition information upon playing the music content; and a music recommendation unit that, when receiving a music recommendation request from the user, creates a recommendation list by extracting music content from the matching table based on the driving condition information upon receiving the music recommendation request. | 2016-05-05 |
| 20160125078 | SOCIAL CO-CREATION OF MUSICAL CONTENT - Disclosed is a system and method that allows for the online and social creation of music and musical thoughts in real-time or near real-time by amateurs and professionals. Individual musical contributions are combined into a single, cohesive musical thought that is presented for approval to the collaborating creators. This solution is extensible from the world of music to other creative endeavors including the written word, video, and digital images. | 2016-05-05 |
| 20160125079 | STORING FINGERPRINTS OF MULTIMEDIA STREAMS FOR THE PRESENTATION OF SEARCH RESULTS - Multimedia stream search results may be made perceivable to a user. A multimedia search query may be received from a user. The multimedia search query may be compared with information related to known multimedia streams and multimedia search results may be determined based on the comparison. A popularity of the multimedia streams corresponding to the multimedia stream search results may be determined based on a number of canonical URLs associated with the multimedia stream. A presentation of the multimedia stream search results to the user may be configured based on the popularity of the corresponding multimedia streams. | 2016-05-05 |
| 20160125080 | Accessing Special Purpose Search Systems - A method includes receiving, at a computing device, a search query from a general purpose search system or a user device in communication with the general purpose search system and assessing, at the computing device, a special purpose search intent of the search query. The method also includes sending a recommendation from the computing device to at least one of the general purpose search system or the user device, the recommendation indicating whether to send the search query to a special purpose search system to obtain special purpose search results. | 2016-05-05 |
| 20160125081 | WEB CRAWLING - Briefly, embodiments disclosed herein may relate to Web crawling, and more particularly may relate to Web crawling for structured content, for example. | 2016-05-05 |
| 20160125082 | Social-Based Optimization of Web Crawling for Online Social Networks - In one embodiment, a method includes a search engine of an online social network crawling a first webpage of a first web domain, where the first webpage includes links to one or more second webpages, each of which may be within a second web domain, accessing a domain ranking for each second web domain, where for each second web domain the domain ranking may be based on one or more domain-quality signals associated with the second web domain, where the domain-quality signals may include a measure of activations of social plug-ins of the online social network associated with webpages of the second web domain, selecting one or more of the second webpages to crawl based at least in part on the domain ranking of the second web domain associated with the second webpage, and the search engine of the online social network crawling each selected second webpage. | 2016-05-05 |
| 20160125083 | INFORMATION SENSORS FOR SENSING WEB DYNAMICS - Disclosed herein are techniques and systems for building “information sensors,” which are programmable “focused crawlers” that periodically discover, extract, analyze and aggregate structured information around a topic from the Web. A platform for building an information sensor allows a user to specify one or more data elements within a data source that the user desires to monitor, and an update frequency at which the data elements are to be extracted. Code may be generated based on the user specifications for creation and submission of the information sensor for storage in a database with metadata containing the code and update frequency. Once created, information sensors are scanned to check if running conditions are met, and if met, they may be executed by retrieving the metadata using a sensor identifier (ID). The code is executed to locate a data source, and periodically extract specified data elements therefrom to output structured time-series data. | 2016-05-05 |
| 20160125084 | ELECTRONIC DEVICE, SEARCH SERVER, AND DATA SEARCH METHOD THEREFOR - An electronic device, a search server, and a data search method are provided herein. The search server includes a communication device configured to receive a plurality of indices for setting a search item. The search server also includes a memory configured to store an index map in which link relations among a plurality of indices are defined. The search server further includes a controller configured to detect at least one path, including the plurality of received indices, using the index map and to set the search item according to the at least one detected path. | 2016-05-05 |
| 20160125085 | RECOMMENDING CONTENTS USING A BASE PROFILE - A method and system for recommending content to a user whose interest(s) has not been identified is disclosed. A base user profile may be created for association with the user. The base user profile may be created by generating a list of ranked interests of a set of representative users. The list of ranked interests may be generated based on activity information obtained for the set of representative users. Content may be recommended to the user based on the base user profile. | 2016-05-05 |
| 20160125086 | NON-BLOCKING LISTENER REGISTRATION IN THE PRESENCE OF DATA GRID NODES JOINING THE CLUSTER - A method of communicating data in a node cluster of a data grid. The method includes receiving, at a listener of a first node, data from a second node that is filtered using the filter during a search query of a node cluster. The method further includes determining, at the listener, that a third node has joined the node cluster during the search query. The method further includes communicating the filter the third node joining the node cluster in response to the third node joining the cluster. The method further includes receiving memory entry data from the third node. The method further includes determining, at the listener, search results using the filtered data and queued data from the second node and the memory entry data from the from the third node. | 2016-05-05 |
| 20160125087 | SYSTEMS AND METHODS FOR SEMANTIC KEYWORD ANALYSIS - In various embodiments, a method for generating from one or more keywords a list of related topics for organic search includes receiving, by a topic tool, an input of one or more keywords for which to generate a list of related topics. The method may further include acquiring, by a crawler, content from a plurality of different web content sources via one or more networks. The method may also include applying, by the topic tool, to the acquired content an ensemble of one or more key phrase extraction algorithms, one or more graph analyses algorithms and one or more natural language processing algorithms to identify a set of semantically relevant topics scored by relevance. The method may also include generating, by the topic tool, from the set of semantically relevant topics, a knowledge graph of related topics for the input of the one or more keywords. The method may further include outputting, by the topic tool based at least partially on the knowledge graph, an enumerated list of topics ranked by at least a relevance score. | 2016-05-05 |
| 20160125088 | DATABASE REGISTRATION - For database user registration a card is provided carrying an identification and a matrix barcode, wherein the matrix barcode stores the identification and a link to an online registration page of a database associated with an issuer of the card. The card may be used in combination with a smartphone for user registration into a database of e.g. a retailer's loyalty card scheme. | 2016-05-05 |
| 20160125089 | METHOD FOR PROVIDING MOBILE SERVICE USING CODE-PATTERN - A method and apparatus for providing a mobile service with the use of a code pattern is disclosed. In one embodiment, the method comprising: taking a photograph of a code pattern image, decoding the photographed code pattern image so as to obtain code information, extracting uniform resource locator (URL) information corresponding to the code information, transmitting a content information request message to a service provider server corresponding to the URL information, and receiving content information corresponding to the URL information from the service provider server. According to embodiments of the present invention, it is possible to provide various and convenient mobile services to mobile terminal users using a mobile terminal, having a camera, and a code pattern containing the URL information. | 2016-05-05 |
| 20160125090 | PRINT MEDIA PRODUCT SUPPORTING INTERACTIVE ASSOCIATION SYSTEM - A plane media product supporting an interactive interconnected system supports transmit-receive of a multimedia information signal. The interactive interconnected system comprises an electronic reading device and an electronic transmitter-receiver. An external surface of the plane media product may be attached with information content. The multimedia information signal is synthesized by media information data and associated data, which is a preset Uniform Resource Identifier. The electronic transmitter-receiver is provided with an associated data reception circuit, an associated data transmission circuit and a central processing unit (with memory). The associated data reception circuit is equipped with a short-distance signal transmission-reception circuit. The electronic transmitter-receiver is configured to control transmit-receive of the associated data of the decomposed multimedia information signal, receive the associated data decomposed by the transmission circuit of the electronic reading device, transmit the associated data to external via a remote wireless technology, and quickly call out an associated electronic file. | 2016-05-05 |
| 20160125091 | READ-ONLY METHOD AND SYSTEM FOR OPERATING PORTABLE DEVICES - A read-only method and a read-only system for operating a portable device are disclosed. The system includes a portable device which has a memory unit and a processing unit, and a host which has a display unit and a processor. A browser requests an access to a portable device inserted to a host. After the storage units been accessed are traced, corresponding service will be performed by the portable device without being blocked by the security system of the host. | 2016-05-05 |
| 20160125092 | WEB COMPONENT DISPLAY BY CROSS DEVICE PORTAL - In an approach to distributing web components for display, a computer receives a request for a plurality of web components from a user on a first computing device. The computer fetches the web components. The computer determines whether the first computing device and one or more additional computing devices are registered in association with the user. Responsive to determining the first computing device and one or more additional computing devices are registered in association with the user, the computer identifies preferred device capabilities for at least one of the web components. The computer identifies a best match of the preferred device capabilities for the at least one of the web components to one or more device capabilities of a target computing device. The computer distributes the at least one of the web components to the first computing device or the one or more additional computing devices. | 2016-05-05 |
| 20160125093 | PARTIAL GRAPH INCREMENTAL UPDATE IN A SOCIAL NETWORK - A social graph is divided into a series of partial graphs having limited hops and reference counts. For each of a plurality of nodes in the social graph, a partial graph for the node is created having a first degree list of nodes reachable in one hop and a second degree list of nodes reachable in two hops. Reference counts of how many paths exist between the node and each node reachable in two hops are also added to the second degree list. A global inverted index is maintained containing a list of all nodes in the social graph and for each node in the social graph a list of nodes that directly connect to the node. The partial graphs created for each of the plurality of nodes are distributed across a plurality of data servers. An index of which partial graphs are stored on which data servers is maintained. | 2016-05-05 |
| 20160125094 | METHOD AND SYSTEM FOR BEHAVIOR QUERY CONSTRUCTION IN TEMPORAL GRAPHS USING DISCRIMINATIVE SUB-TRACE MINING - A method and system for constructing behavior queries in temporal graphs using discriminative sub-trace mining. The method includes generating system data logs to provide temporal graphs, wherein the temporal graphs include a first temporal graph corresponding to a target behavior and a second temporal graph corresponding to a set of background behaviors, generating temporal graph patterns for each of the first and second temporal graphs to determine whether a pattern exists between a first temporal graph pattern and a second temporal graph pattern, wherein the pattern between the temporal graph patterns is a non-repetitive graph pattern, pruning the pattern between the first and second temporal graph patterns to provide a discriminative temporal graph, and generating behavior queries based on the discriminative temporal graph. | 2016-05-05 |
| 20160125095 | LIGHTWEIGHT TEMPORAL GRAPH MANAGEMENT ENGINE - A method and system are provided. The method includes storing, in a memory, temporal data for a temporal graph. The memory includes a temporal graph storage structure having a set of buckets. The temporal data stored in the buckets includes respective data segments implemented using graph edges. Each of the graph edges has a start time and an end time associated therewith. The method further includes the methods, performed by a processor, of: forming an index that categorizes the graph edges based on the end times of the graph edges; positioning the graph edges within respective ones of the buckets for storage using the index such that the graph edges are positioned in the respective ones of the buckets in a chronological order that is based on the end times; and accessing the temporal graph storage structure using the index responsive to a temporal graph query. | 2016-05-05 |
| 20160125096 | CONTEXT AWARE QUERY SELECTION - Context data is determined for a web page. The context data includes textual data that describes subject matter displayed on the web page. A client query is retrieved from a client-retrieved instance of the web page. An identifier associated with the web page capable of distinguishing the web page from other web pages is determined. In response to receiving the client query, a plurality of queries are retrieved from a database. Whether one or more of the retrieved queries correlate the determined web page context and the received client query is determined. A set of one or more queries from the plurality of queries is selected based on the selected set of queries each having been determined to correlate the web page context data and the client query. The selected set of the plurality of the queries is sent to the client-retrieved instance of the web page. | 2016-05-05 |
| 20160125097 | OPTIMIZING POWER FLOWS USING HARMONY SEARCH WITH MACHINE LEARNING - Systems and methods for optimizing power flows using a harmony search, including decoupling phases in a multi-phase power generation system into individual phase agents in a multi-phase power flow model for separately controlling at least one of phase variables or parameters. One or more harmony segments from harmony memory are ranked and selected based on a utility value determined for each of the decoupled phases. A harmony search with gradient descent learning is performed to move the selected harmony segments to a better local neighborhood. A new utility value for each of the selected segments is determined based on historical performance, and the harmony memory is iteratively updated if one or more of the new utility values are higher than a utility value of a worst harmony segment stored in the harmony memory. | 2016-05-05 |
| 20160125098 | AGGREGATE SERVICE WITH SEARCH CAPABILITIES - One embodiment provides a method, involving receiving, at a device, input from a user; requesting, using the input, access to an aggregate service device having access to data stored on at least one non-local user device; receiving, at the device, search criteria from the user; receiving results produced by searching the data stored on at least one non-local user device utilizing the search criteria; and displaying, at the device, the results of the searching. | 2016-05-05 |
| 20160125099 | MODIFYING CONSTRAINED AND UNCONSTRAINED CURVE NETWORKS - Methods for modifying geometric models and corresponding systems and computer-readable mediums. A method includes receiving a geometric model, the geometric model including a plurality of curves. The method includes receiving a selection of one or more curves of the plurality of curves, finding at least one other curve of the plurality of curves that is related to the selected curve, and finding relationships between the selected curve and the other curve(s), including adding the selected curve, the other curve(s), and the relationships to a selected curve set. The method includes pre-processing the selected curve set, including de-activating a set of constraints for the geometric model. The method includes receiving a modification of the selected curve and modifying the selected curve set to produce a modified geometric model and modified selected curve set. The method includes post-processing the modified selected curve set, including re-activating and applying constraints for the geometric model. | 2016-05-05 |
| 20160125100 | AUTO-CONVERSION MECHANISM FOR MULTIPLE THREE-DIMENSIONAL OBJECT REPRESENTATIONS TO FACILITATE COLLABORATION - A system with generalized representation conversion capabilities, including at least one computing device in a client-server structure. A user may operate the client computing device to use a computer-aided design (CAD) software to implement geometric models for multiple objects, and request data from the server. A data store at the server stores necessary information of the system, which includes master representation information of a plurality of master representations (MRs), each MR representing one or more objects. When the user requests an individual representation of a selected object, a conversion module at the server may obtain, from the data store, the master representation information corresponding to the MR of the selected object being requested, and convert the master representation information to individual representation information, which corresponds to the individual representation of the selected object. The conversion module may then send the individual representation information to the client for the user. | 2016-05-05 |
