21st week of 2016 patent applcation highlights part 47 |
Patent application number | Title | Published |
20160147817 | DATA CREDIBILITY VOUCHING SYSTEM - A system, method and program product are provided for implementing a credibility vouching system (CVS). A CVS is disclosed that includes: credibility vouching system (CVS), comprising: a data aggregation system interface that provides a communication pathway for receiving event metadata (EM) records from a data aggregation system; a service provider interface and inquiry system that provides a communication pathway with a plurality of third party service providers to facilitate identification of a set of candidate nodes potentially responsible for a submitted EM record in the data aggregation system; a vouching request routing system for generating a vouching request and tasking at least one third party service provider to forward the vouching request to the set of candidate nodes; and a credibility scoring system that generates a credibility score for the submitted EM record based on a set of vouching responses received from the set of candidate nodes. | 2016-05-26 |
20160147818 | METHOD AND SYSTEM TO REMOVE A SERVICE FROM A DISTRIBUTED DATABASE SYSTEM - A method, medium, and system to receive a request to remove a service of an instance of a distributed database system; redistribute data of the service to be removed to at least one remaining service of the distributed database system; save unsaved log segments of the service to be removed in a log backup; register removal of the service to be removed with the distributed database system; delete an entry of the service to be removed from a startup configuration of the distributed database system; halt operation of the service to be removed; and remove the halted service from internal topology information of the distributed database system. | 2016-05-26 |
20160147819 | Migration of Unified Table Metadata Graph Nodes - Metadata is stored within a database for each of a plurality of objects in different frames associated with a structure descriptor (e.g., a container directory entry, etc.). The frames are part of a metadata page and each comprising an object and a header specifying a version identifier for the object and a size of the object. The structure descriptor initially is built for a first build identifier. Thereafter, upon the structure descriptor changing from the first build identifier to a second build identifier, at least one of the objects that require migration is identified. The identification is based on the version identifier for the object being different from the second build identifier. In response, the identified objects are migrated from their corresponding frame to a new frame. The new frame includes the objects and new headers that include a version identifier equal to the second build identifier. | 2016-05-26 |
20160147820 | Variable Sized Database Dictionary Block Encoding - Dictionary encoding in a table of a database system is initiated using a single page chain. The database system includes a plurality of processor cores and each page chain includes a plurality of chained pages. Thereafter, n additional page chains are generated for use by the dictionary encoding when the count of pages used by the dictionary encoding reaches a pre-determined limit. Generation of additional page chains is later ceased once the number of additional page chains n is equivalent to a number of available processor cores. Related apparatus, systems, techniques and articles are also described. | 2016-05-26 |
20160147821 | Supporting Cursor Snapshot Semantics - A database upon opening each of at least one cursor for a transaction, assigns each statement forming part of a transaction a statement sequence number (SSN) involving at least one row of the database. Thereafter, temporary timestamps are assigned to the at least one row using a transaction identifier and the corresponding SSN. Further, active cursors are monitored such that a final timestamp is prevented from being associated with each row until it has no remaining cursors. Related apparatus, systems, techniques and articles are also described. | 2016-05-26 |
20160147822 | GOLD DATA SET AUTOMATION - Creation and maintenance of preferred or “gold” data sets are automated using objective, predefined rules or filters. The rules may be applied as part of a data publication workflow when new data becomes available in a database. The rules govern the type of data to be included in a gold data set, the currency of the data, the quality of the data, and the naming of the data. This helps reduce the amount of work required by users to create gold data sets and also ensures that the gold data set are up-to-date and high-value. The disclosed approach is particularly suited for use with data from hydrocarbon exploration and production related operations. | 2016-05-26 |
20160147823 | PATTERN-BASED PROBLEM DETERMINATION GUIDANCE - Embodiments in accordance with the present invention disclose a method and system for pattern-based problem determination guidance. The method involves receiving data with respect to a computer system and determining a pattern index based on the data, searching a database to find a matching pattern index, creating problem determination guidance based on the matching pattern index and an associated PCI triplet, sending the guidance to the computer system and receiving feedback from the computer system indicating the corrective action that was implemented, along with a response of the computer system, and storing in the database, data indicating the corrective action, and the response of the computer system to the corrective action. | 2016-05-26 |
20160147824 | METHOD FOR PROCESSING TIME SERIES AND SYSTEM THEREOF - A method for processing time series is disclosed. In the method, the time series is distributed into a plurality of indexes. A statistical method is applied to the data in each index for generating corresponding statistical result. The statistical result is the value with respect to the every index, and also the record with respect to the indexes in the time series. The statistical result for the every index is temporarily buffered. After that, a new input time series is compared with the statistical result for every index so as to select one of the indexes. The new input data is therefore inserted to the selected index. The statistical method is then applied to this selected index again. A new statistical result is generated. The record is updated as referring to the selected index and the new corresponding statistical result. | 2016-05-26 |
20160147825 | METHOD AND ELECTRONIC DEVICE FOR UPDATING THE REGISTERED FINGERPRINT DATASETS OF FINGERPRINT RECOGNITION - A method and electronic device for updating registered fingerprint datasets of fingerprint recognition are provided. The method includes the steps of obtaining an verifying fingerprint dataset, wherein an inputting type of the verifying fingerprint dataset is a pressing type and comparing the verifying fingerprint dataset with a plurality of registered fingerprint datasets, wherein the plurality of registered fingerprint datasets are stored in a storage device; when the verifying fingerprint dataset matches one of the plurality of registered fingerprint datasets, determining whether the inputting type of the registered fingerprint dataset is the same as the inputting type of the verifying fingerprint dataset; and if the inputting type of the registered fingerprint dataset is different from the inputting type of the verifying fingerprint dataset, replacing the registered fingerprint dataset with the verifying fingerprint dataset, wherein the inputting type of the registered fingerprint dataset is a swiping type. | 2016-05-26 |
20160147826 | METHOD AND APPARATUS FOR UPDATING POINTS OF INTEREST INFORMATION VIA CROWDSOURCING - An approach is provided for updating or validating information associated with potential points of interest using crowd sourcing methods. The validation/updating platform determines at least one query from at least one device for location information associated with at least one point of interest. Next, the validation/updating platform determines at least one next location visited by the at least one device. Then, the validation/updating platform causes, at least in part, an updating of the location information associated with the at least one point of interest based, at least in part, on the at least one next location. | 2016-05-26 |
20160147827 | IN-MEMORY DATABASE SYSTEM - An in-memory database system includes database table stored in system memory. The database table comprises a plurality of rows including a particular row. Data corresponding to each row is stored entirely in the system memory. The database table comprises a first version of the particular row having a first valid time, and a second version having a second valid time. Index(es) are associated with the database table. Each index is implemented as a lock-free data structure and references the plurality of rows, including referencing the first and second versions of the particular row. A first transaction acting on the first version of the particular row is executed. The first version of the particular row is visible to the first transaction based on the first valid time and the second version of the particular row being not visible to the first transaction based on the second valid time. | 2016-05-26 |
20160147828 | METHOD AND SYSTEM FOR GENERATING DYNAMIC USER EXPERIENCE - A method for providing user content that may receive, from a user device, a request for content. The method may obtain, in response to the request, a field identifier from a multiple of field identifiers according to a priority for a multiple of fields corresponding to the field identifiers. The field identifier may correspond to a field. The method may obtain application content based on the field identifier. The method may generate declarative content from the application content. The declarative content may express the application content in a declarative programming language. The method may transmit, to the user device, the declarative content. | 2016-05-26 |
20160147829 | EVENT SELECTOR TO GENERATE ALTERNATE VIEWS - An event view selector for a search user interface is described. In one or more implementations, a service may operate to collect and store data as events and apply a late binding schema to extract events that match the search criteria and provide search results for display via the search user interface. The search user interface exposes an event view selector operable to enable transitions between multiple different views of the events associated with different levels of detail. The views may include at least a raw view, a list view, and a table view. Responsive to receiving an indication of a view selected via the event view selector, the selected view may be exposed via the search user interface. | 2016-05-26 |
20160147830 | MANAGING DATASETS PRODUCED BY ALERT-TRIGGERING SEARCH QUERIES - Systems and methods for managing datasets produced by alert-triggering search queries in data aggregation and analysis systems. An example method may comprise: executing, by one or more processing devices, a search query on a portion of searchable data associated with a time window to produce a dataset comprising one or more results; responsive to determining that at least a portion of the dataset satisfies a triggering condition defining an alert associated with the search query, generating an instance of the alert; associating, by a memory data structure, the instance of the alert with an identifier of the search query and a time parameter specifying the time window; receiving, from a client computing device, a request for the portion of the dataset; and responsive to determining that the portion of the dataset is not stored in the memory in a manner associating it with the instance of the alert, reproducing the portion of the dataset by re-executing the search query in view of the time parameter. | 2016-05-26 |
20160147831 | SYSTEM AND METHOD FOR ARRAY-BASED DATA STORAGE AND SEARCH - Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array. | 2016-05-26 |
20160147832 | MISO (MultIStore-Online-tuning) System - A system includes first and second data stores, each store having a set of materialized views of the base data and the views comprise a multistore physical design; an execution layer coupled to the data stores; a query optimizer coupled to the execution layer; and a tuner coupled to the query optimizer and the execution layer, wherein the tuner determines a placement of the materialized views across the stores to improve workload performance upon considering each store's view storage budget and a transfer budget when moving views across the stores. | 2016-05-26 |
20160147833 | CACHING EXTERNAL DATA SOURCES FOR SQL PROCESSING - Techniques are provided for caching external data sources for SQL processing. According to an embodiment, a database system receives a query that requires foreign data from an external data source. In response to receiving the query, the database system determines whether the foreign data currently resides in a cache of the database system. In response to determining that the foreign does not currently reside in the cache, the database system retrieves the foreign data from the external data source, maps the foreign data to a column granule of a table, and stores the column granule in the cache. In another embodiment, the database system receives a second query that requires the foreign data. In response to determining that the foreign data is cached with the stored column granule, the database system retrieves the column granule from the cache. | 2016-05-26 |
20160147834 | Set-Orientated Visibility State Retrieval Scheme - Disclosed herein are system, method, and computer program product embodiments for determining row visibility states. An embodiment operates by initializing a result bitmap for rows based on visible row state values of row state bitmaps corresponding to the rows, wherein values of the result bitmap indicate whether the row are visible or not visible; determining one or more rows whose corresponding visible row state values indicate that the one or more rows are not visible; and determining whether to update the result bitmap to indicate that the one or more rows are visible based on one or more versioned row state values, wherein the one or more versioned row state values indicate whether the corresponding rows are not visible or possibly visible. | 2016-05-26 |
20160147835 | STATIC QUERY OPTIMIZATION - Techniques and structures for tuning database queries. Actual statistics associated with data stored are retrieved from at least one memory device. The data is associated with one or more tenants of the multi-tenant database system. The actual statistics include at least one type of statistic maintained for the data. A subset of the actual statistics is selected based on a data trait targeted for optimization. A statistical value is calculated for each actual statistic from the subset of actual statistics across one or more tenants having the data trait targeted for optimization. An optimal query plan is determined based on the original query and the calculated statistical values. | 2016-05-26 |
20160147836 | Enhanced Network Data Sharing and Acquisition - An enhanced network resources sharing and acquisition is presented to users in on digital data sharing environment. A client device of a user requesting for sharing a digital data resource identified by the user, e.g., a video file, with other users detects the user request and obtains a digital image associated with the digital data resource. The digital data resource is identified by corresponding address information. The client device processes the digital image associated with the digital data resource by embedding the address information into the digital image using digital content embedding techniques such as digital watermarking. The client device uploads the processed digital image to a data sharing platform for sharing. Other users in the data sharing environment retrieve the address information of the digital data resource from the digital image and access the digital data resource using the address information. | 2016-05-26 |
20160147837 | MULTISOURCE SEMANTIC PARTITIONING - Methods, systems, and computer program products for processing a query to determine query results. The query may be analyzed to determine a constant column pair corresponding to the query. The column constant pair may be analyzed with respect to a column constant pair associated with a partitioned data set in order to route the query to a subset of the data set. Data sets may be partitioned into subsets by analyzing historical queries to determine a partitioning column constant pair with respect to the data set that is used to partition the data of the data set into subsets. The query processing may include both query routing and data set partitioning. | 2016-05-26 |
20160147838 | RECEIVING NODE, DATA MANAGEMENT SYSTEM, DATA MANAGEMENT METHOD AND STRAGE MEDIUM - Disclosed is a technique that satisfies both the dispersion performance of the data storage locations and the access efficiency in data acquisition, even when handling a wide variety of sensor data. A receiving node determines, upon receipt of a data storage request or a data acquisition request, a data server in which data is to be stored. The receiving node includes key generation unit which generates a new key using a specified data key and a masked time-of-day acquired by applying a mask to a specified time-of-day, and destination node calculation unit which determines the data server in which the data is to be stored, using the new key generated by the key generation unit. | 2016-05-26 |
20160147839 | Automated Check-ins - In one embodiment, a method includes receiving user input that includes an indication that the user is generating social-network content. The social network includes a number of nodes and a number of edges connecting the nodes, with at least one node corresponding to the user. The method includes accessing information about one or more places corresponding to a location of the user and automatically generating a check-in to one of the one or more places for the user. The method includes automatically associating the check-in with the content. | 2016-05-26 |
20160147840 | SYSTEM FOR RETRIEVING, VISUALIZING AND EDITING SEMANTIC ANNOTATIONS - Annotations can be handled by a computer system that receives a query that specifies parameters for extraction of particular annotations from a set of annotations. Annotations include metadata that describes properties of the associated text fragment. A first entity subset, a second entity subset and a relations subset of annotations are extracted from an annotated text corpus. Contextual information relative to the extracted annotations is also extracted from the corpus. A user interface is generated to display frame elements that include the extracted annotations subsets and the extracted contextual information. In response to selections to the frame elements, the system receives input that specifies modifications to the annotations. Based on the input received, the set of annotations is modified in the annotated text corpus. | 2016-05-26 |
20160147841 | GAIT-BASED BIOMETRIC DATA ANALYSIS SYSTEM - Systems and methods for diagnosing a user's condition based on his gait. A sensor module with multiple sensors is placed inside a user's shoe and biometric data is gathered from the sensors when the user takes a step or walks. The data is used to generate loops as the various sets of data is plotted against each other. The loops obtained from the data are then compared against stored loops previously obtained. Based on the results of the comparison, the user's condition is diagnosed using predetermined indicators of specific health issues. Using the biometric data and in conjunction with data from various databases, it can be determined whether the user has a specific condition, whether a specific condition is worsening, or whether a specific condition is improving. | 2016-05-26 |
20160147842 | BUSINESS INTELLIGENCE MONITORING TOOL - An improved method and apparatus for auditing database queries, wherein comments are added by a server prior to the server forwarding the queries to the database system. The comments are then used to derive audit information, which is correlated with other audit information in a different server, to produce a more complete audit record. | 2016-05-26 |
20160147843 | DESIGN GRAPH - A method, apparatus, system, and computer program product provide the ability to define an attribute of a design part in a manufacturing or construction project. Apart set of two or more design parts is obtained. Each of the two or more design parts includes metadata. An external corpus is mined to determine a text set of terms relevant to the metadata. The metadata is mined for a pattern based on the text set to discover a metadata property. An attribute is defined based on the metadata property. A graphical user interface is used to search for design parts utilizing a filter based on the metadata property. | 2016-05-26 |
20160147844 | Applying Level of Permanence to Statements to Influence Confidence Ranking - An approach is provided to identify permanence data corresponding to terms included in a corpus of a question answering (QA) system. Based on the identified permanence, a time-based confidence of each of the terms is established. Terms are identified as a plurality of candidate answers to a question posed to the QA system. Each of the plurality of candidate answers are scored with the scoring being at least partially based on the time-based confidence established for each of the terms. | 2016-05-26 |
20160147845 | METHODS AND SYSTEMS FOR MANAGING N-STREAMS OF RECOMMENDATIONS - Systems and methods are presented for evaluating and incorporating a plurality of input streams into a single input stream. In some embodiments, the system generates a first set of recommendations provided by a plurality of input streams and receives one or more selections of recommendations from the first set of input streams. The system determines a session intent based on the one or more selections and selects a set of input streams, from the plurality of input streams, corresponding to the one or more selection and the session intent. The system generates a second set of recommendations using the set of input streams and the session intent and causes presentation of the second set of recommendations on a user interface of a user device. | 2016-05-26 |
20160147846 | CLIENT SIDE SYSTEM AND METHOD FOR SEARCH BACKED CALENDAR USER INTERFACE - A method is provided to produce a custom calendar user interface (UI) display on an electronic device display screen comprising: providing a search query to a user device; sending the search query over the network to a server system; receiving over the network by one or more user devices from a server system, information that identifies one or more code objects that match the search query; using the identified one or more identified code objects by the one or more user devices to generate one or more visual content items within a calendar user interface (UI) grid display on their device display screens. | 2016-05-26 |
20160147847 | PRESENTING ANTICIPATED USER SEARCH QUERY RESULTS PROMPTED BY A TRIGGER - A method for presenting search query results is provided. The method may include detecting an occurrence of the trigger event. The method may include determining a category of information based on data associated with the trigger event. The method may include identifying at least one constraint based on the determined category of information. The method may include appending to the identified at least one constraint to the determined category of information. The method may include generating at least one search query. The method may include selecting at least one candidate website based on the category of information. The method may include performing the at least one search query on the at least one candidate website. The method may include filtering each search query result within the search query results. The method may include sending each filtered search query result within the search query results to a user. | 2016-05-26 |
20160147848 | Visual Presentation of Search Results - The present disclosure involves displaying a search result by selecting a repository for searching; inputting one or more keywords for searching, wherein at least one of the one or more keywords is a location mandatory keyword; searching the selected repository for one or more documents that contain the one or more inputted keyword to generate a search result; defining at least two elements of a tree structure view; selecting a portion of the tree structure view to display and displaying the search result in the selected portion of the tree structure view. Also, one of the at least two elements maybe a subset of another of the at least two elements. In some examples, a display includes at least four bucket categories based which are displayed for one of the at least two elements. | 2016-05-26 |
20160147849 | GENERATING ALTERNATE VIEWS OF SEARCH DISPLAY INTERFACES - An event limited field picker for a search user interface is described. In one or more implementations, a service may operate to collect and store data as events each of which includes a portion of the data correlated with a point in time. Clients may use a search user interface perform searches by input of search criteria. Responsive to receiving search criteria, the service may operate to apply a late binding schema to extract events that match the search criteria and provide search results for display via the search user interface. The search user interface exposes an event limited field picker operable to make selections of fields with respect to individual events in a view of the search results. In response to receiving an indication of a fields selected via the picker, visibility of selected fields may be updated to control which field and values are included in different views. | 2016-05-26 |
20160147850 | ENTERPRISE DATA WAREHOUSE MODEL FEDERATION - The present disclosure describes methods, systems, and computer program products for providing data warehouse model federation. One computer-implemented method includes receiving a request to transform a first semantically enriched model to a second semantically enriched model, wherein the first semantically enriched model operates in a first data warehouse and the second semantically enriched model operates in a second data warehouse; identifying a set of data associated with the first semantically enriched model, wherein the set of data is stored in the first data warehouse; providing access to the set of data associated with the first semantically enriched model from the second data warehouse; creating the second semantically enriched model based on the first semantically enriched model using an interface of the second data warehouse; and deploying the second semantically enriched model in the second data warehouse. | 2016-05-26 |
20160147851 | CREATION OF CHANGE-BASED DATA INTEGRATION JOBS - A computer software implemented method for transforming a first extract transform load (ETL) job having at least some unload transform load (UTL) portions. The method includes the following steps: (i) decomposing the first ETL job into an intermediate set of one or more jobs; and (ii) for each job of the intermediate set, transforming the job into a transactionally equivalent job to yield a final set of one or more jobs. The decomposing is performed so that each job of the intermediate jobs set is a Simple UTL job. The transforming is performed so that each job of the final set includes no UTL portions. | 2016-05-26 |
20160147852 | SYSTEM AND METHOD FOR ROUNDING COMPUTER SYSTEM MONITORING DATA HISTORY - According to some embodiments, monitoring data for a computer system may be received, the monitoring data including at least one d digit operating performance parameter of the computer system. A rounding engine processor may automatically transform the monitoring data into rounded monitoring data such that the d digit operating performance parameter is rounded to preserve only the m most significant digits, where m is less than d. The rounded monitoring data may then be stored within a rounded monitoring data history of a history storage unit. | 2016-05-26 |
20160147853 | METHOD AND SYSTEM FOR CONSOLIDATING DATA RETRIEVED FROM DIFFERENT SOURCES - A method is provided for consolidating data retrieved from different text records stored in different languages and associated with a single user. According to an embodiment, the method comprises the steps of: extracting a plurality of users' identifications from a plurality of text records and converting them into a corresponding plurality of speech records, each being essentially identical to the pronunciation of a corresponding user identification in a language which its respective text record has been stored; converting each speech record to a respective data record; extracting from the data records obtained, at least one group of data records comprising two or more data records essentially identical to each other; for each of the groups, retrieving information comprised in two or more text records which are stored in different languages from each other; and storing the information retrieved in a consolidated text record. | 2016-05-26 |
20160147854 | DATA TRANSFER BETWEEN MULTIPLE DATABASES - A parallel track/sector switching device and associated method is provided. The method includes identifying data replication sources and locating data replication targets associated with the data replication sources. Data replication instances associated with moving data from the data replication sources to the data replication targets are determined. A first data replication instance for moving first data from a first data replication source to a first data replication target is determined and an antenna capacity associated with the first data replication source and the first data replication target is identified. A memory to track ID map associated with a storage device of the first data replication target is identified and it is determined if a last replication slot has been allotted to the first data replication target based on the memory to track ID map. | 2016-05-26 |
20160147855 | CONTENT-BASED REPLICATION OF DATA IN SCALE OUT SYSTEM - Methods, systems, and programs are presented for replicating data across scale-out storage systems. One method includes replicating, from an upstream to a downstream system, a volume snapshot having one or more bins. Locations for the bins of the snapshot are identified, the location for each bin including the upstream array storing the bin and the downstream array storing a replicated version of the bin. Each bin is validated by comparing an upstream bin checksum of the bin with a downstream bin checksum of the replicated version of the bin. When the checksums are different, a plurality of chunks are defined in the bin, and for each chunk in the bin an upstream chunk checksum calculated by the upstream array is compared with a downstream chunk checksum calculated by the downstream array. The chunk is sent from the upstream to the downstream array when the chunk checksums are different. | 2016-05-26 |
20160147856 | REPLICATING A SOURCE STORAGE SYSTEM - For replicating a source storage system, a scan module generates a source storage server description for each source storage server of the source storage system from a scan of the source storage system. The source storage server description includes a replication type and a source volume record for each source logical volume of the source storage server. A provision module determines a number of replicated instances of each source logical volume for a target storage system from the replication type. In addition the provision module generates a target storage server description for each target storage server of the target storage system from each source storage server description in response to the target storage system satisfying a target storage requirement. | 2016-05-26 |
20160147857 | METHOD AND SYSTEM FOR SYNCHRONIZING DATA - A computer-implemented method for synchronizing a first data object to a second data object, wherein, each data object is assigned to a metaclass from a number of metaclasses, the metaclasses being organized in a tree structure with a root metaclass; a metaclass in the tree structure is ascertained that is situated on the path between the first data object and the root metaclass and on the path between the second data object and the root metaclass, a first and a second metaobject are produced from the ascertained metaclass; two transformations are performed to transform the first data object into the first metaobject and the second data object into the second metaobject; the first metaobject and the second metaobject are synchronized; and a third transformation is performed, the first metaobject being transformed into the first data object and the second metaobject being transformed into the second data object. | 2016-05-26 |
20160147858 | Log Forwarding to Avoid Deadlocks During Parallel Log Replay in Asynchronous Table Replication - Disclosed herein are system, method, and computer program product embodiments for removing a deadlock during replication from distributed source tables to a replica node. An embodiment operates by detecting a deadlock at a parallel log replayer at a replica node. A first replication log entry from a queue at the parallel log replayer is then selected based on whether removing the first replication log entry from the queue removes the deadlock. The first replication log entry is then forwarded to a waiting queue. A second replication log entry is then replayed at the parallel log replayer. After replaying the second replication log entry, the first replication log entry is replayed at the parallel log replayer. | 2016-05-26 |
20160147859 | Transactional and Parallel Log Replay for Asynchronous Table Replication - Disclosed herein are system, method, and computer program product embodiments for replicating a database transaction to a replica table. An embodiment operates by receiving a replication log entry and an associated transaction commit log entry for a database transaction to be replayed to a row at a replica table. A row-ID value of the replication log entry is compared to a row-ID column value of the row at the replica table. The replication log entry is then replayed at a parallel log replayer based on the comparison. The database transaction is then committed to the replica table by replaying the associated transaction commit log entry at a transaction log replayer. | 2016-05-26 |
20160147860 | System and method for hierarchical synchronization of a dataset of image tiles - A system and method for hierarchical synchronization of tiles between a first dataset and a second dataset by computing and storing multiple composite cluster hash values for multiple clusters in the first and second dataset. For each of the composite cluster hash values, comparing a composite cluster hash value of a particular cluster in the first dataset with a composite cluster hash value of a corresponding cluster in the second dataset. When the composite cluster hash values of the corresponding clusters do not match, retrieving all tile hashes corresponding to all the tiles from the non-matching cluster in the first dataset, and retrieving all tile hashes corresponding to all the tiles from the non-matching cluster in the second dataset. Finally, determining the one or more changed tiles between the non-matching cluster in the first dataset and the non-matching cluster in the second dataset by comparing the corresponding tile hashes. | 2016-05-26 |
20160147861 | Database System With Transaction Control Block Index - A plurality of transactions is handled in a database. Each transaction includes a plurality of operations on at least one record in the database with at least two of the transactions being handled concurrently. Thereafter, a temporary timestamp is assigned to each record. The temporary timestamp are based, at least in part, on the corresponding transaction. Further, a final timestamp is assigned to each record with a commit operation. It can later be determined, using a visibility function and based on the assigned temporary timestamps and final timestamps, which of the records are visible in a consistent view for a first transaction. Based on such determination, access can be provided to those records determined to be visible to be accessed to the first transaction. | 2016-05-26 |
20160147862 | Delegation of Database Post-Commit Processing - A plurality of transactions are handled in a database. Each transaction comprises a plurality of operations on at least one record in the database with at least two of the transactions being handled concurrently. Thereafter, a temporary timestamp is assigned to each record that is based, at least in part, on the corresponding transaction. A first transaction among the plurality of transactions is subsequently committed. Afterwards, re-stamping of at least one commit timestamp modified by the first transaction is delegated. Related apparatus, systems, techniques and articles are also described. | 2016-05-26 |
20160147863 | TOPIC BASED CLASSIFICATION OF DOCUMENTS - Systems and methods for classification of documents based on topic to which the documents pertain are described herein. In one implementation, the method comprises computing a probability of a document being topical based on a number of constituent elements that are topical and a total number of constituent elements and computing a probability of the document being anti-topical based on a number of constituent elements that are anti-topical and the total number of constituent elements. The method further comprises determining whether the probability of the document being topical is greater than the probability of the document being anti-topical. Thereafter, the method includes classifying the document as topical on determining the probability of the document being topical to be greater than the probability of the document being anti-topical. | 2016-05-26 |
20160147864 | METHOD AND SYSTEM FOR ONLINE COLLABORATION FOR DEVELOPING DIGITAL CONTENT - A computer network system implemented to facilitate online collaboration for developing a digital content. The system includes a database configured to provide means for storing and retrieving profiles of a plurality of digital artists, and categorizing the profiles based on skills of the digital artists to provide at least one predefined service relating to developing the digital content. The system also includes a web based platform configured to provide means for inputting one or more pieces of information about a concept of the digital content. The web based platform also provides means for selecting one or more digital artists from the plurality of digital artists for participation in the development of the digital content from the concept. The web based platform further provides means for storing the completed digital content, after development, in a data repository. | 2016-05-26 |
20160147865 | DETECTING FEACAL AND URINE EVENTS BY REFERENCE TO COLLECTIONS OF DATA - A method for analysing incoming data, comprising the steps of processing the incoming data in segments to output a sequence of segment types by extracting one or more properties of an incoming data segment and forming an Unknown Property Vector for each segment of data in the incoming data, and processing the sequence of segment types to identify events in the incoming data. The sequence of segment types is determined, for each segment, by analysing the Unknown Property Vector by reference to one or more collections of vectors obtained from a set of Reference Property Vectors. This may each of the one or more collections of vectors being selected from the set of Reference Property Vectors randomly or based on relevance or clustering. | 2016-05-26 |
20160147866 | PROCESSING USER PROFILES - A system for processing user profiles. A similarity based clustering algorithm is executed to generate clusters of user profiles. Each cluster includes a group of users in an electronic community. Each cluster represents a relationship between the users in each group that each cluster includes. Each cluster is stored in a user profile and relationship database. The similarity based clustering algorithm includes s a member importance function and a member similarity function. The member importance function ascertains an importance value of keywords as a depth of the keywords in a semantic hierarchical tree. The member similarity function ascertains a similarity distance between keywords as a path distance between the keywords in the semantic hierarchical tree. Executing the similarity based clustering algorithm includes: using the member importance function and the member similarity function to ascertain the clusters. | 2016-05-26 |
20160147867 | INFORMATION MATCHING APPARATUS, INFORMATION MATCHING METHOD, AND COMPUTER READABLE STORAGE MEDIUM HAVING STORED INFORMATION MATCHING PROGRAM - An information matching apparatus includes a target DB corresponding to a check target that stores therein records; a narrow-down condition creating unit that combines, in accordance with values of check items in a check source record using AND, a search condition defined by a search definition indicating a condition for excluding candidates in check target records that are less likely to have a similarity to or a relationship with a name identification source record and each grouping condition defined by a grouping definition indicating a condition for limiting a checking area of the check target records to create a narrow-down condition for narrowing down the check target records; and a searching unit that searches the target DB corresponding to the check target for a check target record in accordance with the created narrow-down condition. | 2016-05-26 |
20160147868 | MEDIA CONTENT SEARCH BASED ON A RELATIONSHIP TYPE AND A RELATIONSHIP STRENGTH - Provided are techniques for a media content search based on a relationship type and a relationship strength. Selection of two objects in a media file in media content is received. Search criteria for a relationship type and a relationship strength between the two objects is received. One or more media files in the media content are identified in which the two objects have the relationship type and the relationship strength. | 2016-05-26 |
20160147869 | METHOD AND SYSTEM FOR INDEXING, RELATING AND MANAGING INFORMATION ABOUT ENTITIES - Systems and methods for use in association with a master entity index system may allow data records to be grouped together into various entities, where each of the entities may represent a logical or physical item. These entities may also be associated with one another in a manner such that relationships between entities may likewise be represented. In one embodiment, an interface may be provided for use in conjunction with the master entity index system such that these various entities and relationships may be better managed, manipulated or visualized. This interface may allow a user to search for or otherwise obtain an entity, where a representation of this entity and one or more associated entities may be presented to the user along with representations of the relationships between these entities. | 2016-05-26 |
20160147870 | TERMS FOR QUERY EXPANSION USING UNSTRUCTURED DATA - A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision. | 2016-05-26 |
20160147871 | ENTITY-RELATION BASED PASSAGE SCORING IN A QUESTION ANSWERING COMPUTER SYSTEM - According to an aspect, a query and a passage are parsed by a language parser to detect noun-centric phrases and verb-centric phrases in the query and the passage. Entities, including at least one untyped entity, are identified based on the noun-centric phrases and relations are identified based on the verb-centric phrases. Entity pairs are created that include an entity identified in the query and an entity identified in the passage, each pair satisfies a matching criteria. Relation pairs are created that include a relation identified in the query and a relation identified in the passage, each pair satisfies a matching criteria. A passage score that indicates the likelihood that an answer to the query is contained in the passage is determined based on the entity pairs, the matching criteria satisfied by each entity pair, the elation pairs, and the matching criteria satisfied by each relation pair. | 2016-05-26 |
20160147872 | NEW TERMS FOR QUERY EXPANSION USING UNSTRUCTURED DATA - A processor determines a set of terms frequently occurring within unstructured data associated with criteria of a query. The processor analyzes the unstructured data to match a term of the set of terms, to criteria of the query. Matching terms are retained and unmatched terms are checked for semantic similarity to terms of the criteria to determine an inferred match of the term of the unstructured data to terms of the criteria of the query. In response to determining an inferred match, the inferred match term is added to the second set of terms, and the processor compares the second set of terms to the terms of the criteria of the query, and removes matching terms, resulting in a third set of terms added to the set of criteria terms of the query. The additional query terms will enhance the recall without diluting the precision. | 2016-05-26 |
20160147873 | INFORMATION PROVIDING SYSTEM, INFORMATION PROVIDING METHOD, NON-TRANSITORY RECORDING MEDIUM, AND DATA STRUCTURE - Provided is an information providing system capable of changing a response to an input from a user based on a predetermined response condition and further making a user terminal to perform a specified behavior (action) in outputting the response. An information providing server selects a reference text semantically closest to the input sentence from a user from knowledge data to determine a response text associated with the reference text. If a plurality of response texts are associated with the reference text, the information providing server determines the response in accordance with the response condition. Furthermore, the information providing server controls the user terminal to perform the behavior registered with the reference text. | 2016-05-26 |
20160147874 | Generating Derived Links - A system, method, computer program product and computer program for evaluating links between objects are provided. A receive ontology component receives an ontology and an identify component identifies, from the ontology, semantic feature types within the ontology that can be used to measure the links between the objects. A data receive component receives instance information and maps the instance information into an ontological form of the instance information. An analyze component analyzes the ontological form to generate an ontological mapping of the instance information. A match component analyzes the mapping to identify matches with semantic patterns. A strength component analyzes the associated semantic features associated with the objects of the matches to determine weightings for the links of the matches. An alert component provides the links and associated weightings. | 2016-05-26 |
20160147875 | Question Pruning for Evaluating a Hypothetical Ontological Link - Mechanisms for generating a set of questions to evaluate a link between concept entities are provided. A hypothetical link between at least two information concept entities is generated. A set of questions corresponding to the hypothetical link is retrieved and pruned into a subset of questions based on at least one of characteristics of the hypothetical link or characteristics of the at least two information concept entities. The pruned set of questions is processed based on a corpus of evidence to generate a measure of support for or against the hypothetical link being an actual link between the at least two information concept entities. A validity indication for the hypothetical link indicating whether or not the hypothetical link is an actual link between the at least two information concept entities is output. | 2016-05-26 |
20160147876 | SYSTEMS AND METHODS FOR CUSTOMIZED MUSIC SELECTION AND DISTRIBUTION - Improved systems and methods for customized selection and distribution of music are described herein. In one embodiment, a system for selecting music is provided that includes a plurality of profiles stored in a digital data store that correlate a group of users to a plurality of music tracks. The system further includes a user interface configured to receive input data including at least one characteristic of a user and at least one of (i) a purpose for playing music and (ii) a characteristic of an environment in which music is played. The system also includes a digital data processor configured to search the plurality of profiles for at least one match to the input data and select at least one music track from the plurality of music tracks that is correlated with the at least one match to the input data. | 2016-05-26 |
20160147877 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD AND INFORMATION PROCESSING PROGRAM - The present invention provides an information processing apparatus which can direct a user to a playlist different from a playlist being reproduced. There is provided the information processing apparatus including a content storage unit storing a plurality of contents therein, a playlist storage unit storing a plurality of playlists which is related to at least some of the plurality of contents, a reproducing unit sequentially reproducing a plurality of contents belonging to a first playlist in a plurality of playlists, a candidate content extracting unit extracting one or more candidate contents relating to a content being reproduced by the reproducing unit from the content storage unit, a playlist extracting unit extracting a second playlist to which the extracted candidate contents belong from the playlist storage unit, and a playlist switching unit switching a playlist to be reproduced by the reproducing unit from the first playlist into the second playlist. | 2016-05-26 |
20160147878 | SEMANTIC SEARCH ENGINE - Semantic Search Engine using Lexical Functions and Meaning-Text Criteria, that outputs a response (R) as the result of a semantic matching process consisting in comparing a natural language query (Q) with a plurality of contents (C), formed of phrases or expressions obtained from a contents' database ( | 2016-05-26 |
20160147879 | Fuzzy Search and Highlighting of Existing Data Visualization - A user may provide input to search an existing visualization (e.g., bar chart, graph) of a dataset returned in response to database querying. A highlighted visualization may then provide additional insight into relationships within the dataset. The highlighting may comprise changes to the appearance (e.g., size, color, background) of visualization elements. The search and highlighting may be executed by a functional module in an application layer of a local client in communication with database on a remote server. A search engine of the functional module may perform searching of dimension names, dimension values, and measure names within the dataset, identifying particular elements of the data set that are relevant to a search term (e.g., “q1”). Based upon recognition of relevant dataset data, a visualization engine may highlight particular elements of the visualization (e.g., changing an appearance of vertical bars showing first quarter revenue relative to vertical bars for other quarters). | 2016-05-26 |
20160147880 | MULTI-DIMENSIONAL VISUALIZATION OF QUERY EXECUTION IN DISTRIBUTED DATABASES - The present disclosure describes methods, systems, and computer program products providing multi-dimensional visualization of a query executing in a distributed database according to an implementation. Log data for an executing query is received from each database server forming a distributed database system. The received log data is processed to generate a multi-dimensional visualization of the database query execution, the multi-dimensional visualization transmitted to display on a client device and including representing: 1) each database server as a point on a circular structure, 2) a progression of time with respect to each point as a line projecting perpendicularly from the circular structure and connecting to another circular structure with time the same at a particular corresponding point on each line, 3) data traffic as inwardly-pointing data traffic lines connecting the lines, and 4) information about database query execution in an outwardly direction from the lines representing the database. | 2016-05-26 |
20160147881 | RELATION AWARE AGGREGATION (RAA) ON NORMALIZED DATASETS - The present disclosure provides methods for performing a computation with an aggregate function using a database query, wherein the database query joins a plurality of database tables and includes a distinct aggregation function, which, when executed against one or more databases aggregates only values of database records corresponding to distinct keys by which the tables are joined, regardless of the cardinality of the joined tables. Related devices and systems are also provided. | 2016-05-26 |
20160147882 | Object Search Method and Apparatus - An object search method and apparatus, where the method includes receiving voice input and gesture input that are of a user; determining, according to the voice input, a name of a target object for which the user expects to search and a characteristic category of the target object; extracting characteristic information of the characteristic category from an image area selected by the user by means of the gesture input; and searching for the target object according to the extracted characteristic information and the name of the target object. The solutions provided in the embodiments of the present disclosure can provide a user with a more flexible search manner, and reduce a restriction on an application scenario during a search. | 2016-05-26 |
20160147883 | METHOD AND SYSTEM FOR DETERMINING DEFECTS PER UNIT OF A PRODUCT - A method, implemented on a computing device, for determining defects per unit of a product is disclosed. The method initiates with generating a data retrieval session between a processor and a database server. Thereafter, a product test data from the database server is retrieved based on a query executed by the processor. A data updating session between the database server and a plurality of data sources is then generated. The data updating session is terminated during retrieval of the product test data. Additionally, the product test data retrieved is inaccessible by the plurality of data sources. Moreover, the defects per unit is displayed through a display unit. The database server reactivates the data updating session with the data sources in response to the conclusion of the display of the defects per unit. | 2016-05-26 |
20160147884 | UNIFIED COMMUNICATION AUDIT TOOL - Providing for dynamic auditing of components of a communication network is provided herein. By way of example, network components can be queried by way of dynamic and intelligent application programming interface (APIs) queries to extract data for the network components. Such data can then be compared with best practice rules to identify potential enhancements to efficiency or scalability of such components. In some aspects, an audit report can be output summarizing identified enhancements. In other aspects, data can be written to an updated component according to protocols suited to such component. Accordingly, an audit can provide feedback in light of best practices or can be utilized to dynamically upgrade a legacy system to newer system software and/or hardware components. | 2016-05-26 |
20160147885 | NORMALIZATION OF CONFIDENCE THRESHOLDS IN FEDERATED ENVIRONMENTS - Embodiments of the present invention provides methods, computer program products, and systems for normalizing confidence score thresholds across systems in a federated environment. Embodiments of the present invention can be used to calculate normalization factors for participating hubs in a federated environment to normalize confidence score thresholds applied by those hubs and improve search results obtained therefrom. | 2016-05-26 |
20160147886 | Querying Groups of Users Based on User Attributes for Social Analytics - A system determines a set of users satisfying a given criteria based on attribute values of the users. The system associates each value of an attribute with a representation of users having that attribute value. The representation of users may be an enumeration of users or a bit index. The system receives a request for determining a set of users satisfying a given criterion. The system identifies a logical operation based on the criterion and performs the logical operation to determine the set of users. The representation of the set of users may be distributed across a plurality of processors, allowing the system to perform the logical operation in parallel. The system may further determine statistical information describing a characteristic of the set of users, for example, page likes by the set of users. The statistical information may be presented to a business for analyzing their target audience. | 2016-05-26 |
20160147887 | OPTIMIZING FACETED CLASSIFICATION - In an approach to faceted classification, a computer receives a search query. The computer creates a first table of facet value ranges, based on the search query. The computer fetches a first search result corresponding to the search query. The computer retrieves a first facet value associated with the first search result. The computer maps the first facet value to a first facet value range. The computer determines whether the first facet value range is in the first table of facet value ranges. The computer inserts the first facet value range into the first table of facet value ranges. The computer determines whether a number of facet value ranges in the first table of facet value ranges is below a pre-defined threshold. The computer creates a second table of facet value ranges. The computer identifies a second facet value range that includes the first facet value range. | 2016-05-26 |
20160147888 | FEDERATION OPTIMIZATION USING ORDERED QUEUES - Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time. | 2016-05-26 |
20160147889 | PRESENTING ANTICIPATED USER SEARCH QUERY RESULTS PROMPTED BY A TRIGGER - A method for presenting search query results is provided. The method may include detecting an occurrence of the trigger event. The method may include determining a category of information based on data associated with the trigger event. The method may include identifying at least one constraint based on the determined category of information. The method may include appending to the identified at least one constraint to the determined category of information. The method may include generating at least one search query. The method may include selecting at least one candidate website based on the category of information. The method may include performing the at least one search query on the at least one candidate website. The method may include filtering each search query result within the search query results. The method may include sending each filtered search query result within the search query results to a user. | 2016-05-26 |
20160147890 | Identifying Content Items From Various Sources Associated with an Object - An online system receives content items from one or more content sources. The content items are mapped to objects in a database of the online system based on measures of affinity of the content items for the objects. When a query identifying an object in the database is received by the online system, the online system identifies content items associated with the identified object. Information describing the identified content items is generated by the online system and provided to a user or entity from which the query was received. Additionally, information describing social engagement with the identified object may be determined based on the content items mapped to the identified object and included in the information describing the identified content items. | 2016-05-26 |
20160147891 | Building a Topical Learning Model in a Content Management System - A content management system receives a plurality of topics extracted from documents stored by the system. Pairings between the topics are generated, where a pairing between two topics is generated responsive to the two topics appearing in proximity to one another in one or more of the documents. A complexity of each received topic is also determined. The content management system generates a progression of the topics based on the complexity of the topics and the pairings between the topics. The progression comprises a sequential ordering of paired topics, in which a topic in the ordering has a higher complexity than a preceding topic. Responsive to a user of the content management system accessing content associated with a topic in the progression, a next topic in the progression is recommended to the user. | 2016-05-26 |
20160147892 | METHODS AND SYSTEMS FOR SOCIAL NETWORK BASED CONTENT RECOMMENDATIONS - Systems and methods are presented for generating recommendations using multi-level social network analysis of user behavior. In some embodiments, the system receives a set of user interactions, from a plurality of users, performed on a set of data objects; generates a set of associations between the set of data objects; and identifies a set of data object clusters indicative of the set of associations. The system generates an organization of the set of data objects based on the set of associations and the set of data object clusters and causes presentation of a plurality of data objects of the set of data objects on a user interface of a user device based on the organization. | 2016-05-26 |
20160147893 | Searching for Content by Key-Authors on Online Social Networks - In one embodiment, a method includes receiving, from a client device of a first user of an online social network, a search query associated with a first topic. The method also includes identifying one or more key-authors associated with the first topic. The method further includes retrieving multiple objects of the online social network matching the search query, where one or more of the retrieved objects are associated with the first topic and are authored by at least one of the identified key-authors. The method also includes generating multiple search-results modules, each search-result module including references to one or more of the retrieved objects. At least one of the search-results modules is a key-authors-module that includes references to one or more of the retrieved objects associated with the first topic that are authored by at least one of the identified key-authors. | 2016-05-26 |
20160147894 | METHOD AND SYSTEM FOR FILTERING SEARCH RESULTS - The present disclosure illustrates a method for filtering search results. The method comprises the steps of: receiving a keyword; searching by the keyword to obtain an initial search result which comprises a plurality of web pages, and searching at least one related word corresponding to the keyword; clustering the related word to generate a clustered result which comprises at least one clustered group; providing the clustered result to an user such that the user selects one clustered group from the clustered group; and filtering the initial search result based upon the selected clustered group to generate a filtered search result. | 2016-05-26 |
20160147895 | OPTIMIZING FACETED CLASSIFICATION - In an approach to faceted classification, a computer receives a search query. The computer creates a first table of facet value ranges, based on the search query. The computer fetches a first search result corresponding to the search query. The computer retrieves a first facet value associated with the first search result. The computer maps the first facet value to a first facet value range. The computer determines whether the first facet value range is in the first table of facet value ranges. The computer inserts the first facet value range into the first table of facet value ranges. The computer determines whether a number of facet value ranges in the first table of facet value ranges is below a pre-defined threshold. The computer creates a second table of facet value ranges. The computer identifies a second facet value range that includes the first facet value range. | 2016-05-26 |
20160147896 | Providing Additional Functionality With Search Results - A method includes receiving, at a computing device, a search query from a remote device. The method further includes identifying a primary set of application state records, selecting a first application state record from the primary set of application state records, and identifying an entity name and action associated with the first application state record. The method further includes identifying a second application state record associated with the same entity name as the first application state record and a different action than the first application state record. Additionally, the method includes generating a combined result based on the first application state record and the second application state record, generating search results based on the primary set of application state records, and transmitting the search results to the remote device. The search results include the combined result in addition to search results based on the primary set of application state records. | 2016-05-26 |
20160147897 | METHOD, SYSTEM AND TERMINAL FOR PERFORMING SEARCH IN A BROWSER - A method for performing a search in a browser is provided. The method includes receiving one or more keywords entered in a current search engine and searching data from the current search engine based on the entered keywords. The method also includes displaying a search engine results page from the current search engine to a user and displaying alternative search engines when detecting that an operation event of the user in the search engine results page meets preset switching criteria. Further, the method includes extracting a search web address template corresponding to an alternative search engine selected by the user and loading the entered keywords into the search web address template corresponding to the selected alternative search engine to search data from the alternative search engine. In addition, the method includes displaying a search engine results page from the selected alternative search engine. | 2016-05-26 |
20160147898 | SEARCHING CONTENT BASED ON TRANSFERRABLE USER SEARCH CONTEXTS - A search context is recorded during a search performed by a first user. The search context may include environmental variables associated with the computing equipment used by the first user such as at least one of regional settings, geographic location, social attributes, job role, browse history, and cookie files. The search context may be encrypted or be restricted for use by certain users and for a specific period of time. The search context may be sent to a second user or a group. The context is applied to environmental variables associated with the computing equipment used by the second user. The second user can thereby substantially duplicate the search performed by the first user. | 2016-05-26 |
20160147899 | Self Populating Address Book - System, methods and computer program products for creating and maintaining an address book are described. The address book may collect or update its existing contact information from sent or received communications. Contact information associated with the existing contacts also may be collected (or updated based on information received) from outside sources (e.g., external to an application hosting or accessing the address book). The address book may intelligently combine profile data from various sources to enrich the existing records associated with the contacts. | 2016-05-26 |
20160147900 | AUTOMATIC DEVICE UPLOAD CONFIGURATION - Various embodiments of the present technology involve the configuration of a wireless-enabled memory card. For example, a client application associated with a content management system (CMS) can obtain a computing device's current wireless configuration information, request a temporary authentication token from the CMS, encode this information in a visual code, and display this visual code on a display screen of the computing device. A user can capture an image of the visual code with a camera, thereby, causing the memory card to extract the wireless configuration information and token from the image, and connect to the specified wireless network. Once connected, the temporary authentication token is exchanged for an access token allowing the memory card to automatically send images captured by the camera to an account with the CMS for storage. | 2016-05-26 |
20160147901 | Generating Derived Links - A system, method, computer program product and computer program for evaluating links between objects are provided. A receive ontology component receives an ontology and an identify component identifies, from the ontology, semantic feature types within the ontology that can be used to measure the links between the objects. A data receive component receives instance information and maps the instance information into an ontological form of the instance information. An analyze component analyzes the ontological form to generate an ontological mapping of the instance information. A match component analyzes the mapping to identify matches with semantic patterns. A strength component analyzes the associated semantic features associated with the objects of the matches to determine weightings for the links of the matches. An alert component provides the links and associated weightings. | 2016-05-26 |
20160147902 | DATA PROVISION DEVICE, DATA PROVISION METHOD, AND DATA PROVISION PROGRAM - A data provision device includes a determination unit that determines at least some of selectable items contained in a web page to be provided to a user terminal as a prefetch item based on an event that can occur in the user terminal to which the web page is provided, a generation unit that generates a data set composed of a group of data to be transmitted to the user terminal according to selection of the prefetch item determined by the determination unit, and a transmitting unit that, when selection of an item is received from the user terminal, transmits a data set corresponding to the item and generated by the generation unit to the user terminal. | 2016-05-26 |
20160147903 | DYNAMIC DATA SOURCE BINDING - A method for customizing a user interface of a server-side business application on a client device includes querying the server-side business application for information on an available data source in a current context of the business application and for information on a data type of the available data source. The method further involves mapping the data type of the available data source to a user interface (UI) element type and loading an UI element of the mapped UI type in the user interface on the client device. The method includes the server-side business application to retrieve data from the available data source, and displaying the retrieved data via the loaded UI element in the user interface of the business application on the client device. | 2016-05-26 |
20160147904 | FAST ROW TO PAGE LOOKUP OF DATA TABLE USING CAPACITY INDEX - The subject matter disclosed herein provides methods for determining the page on which a desired row position value is located. A table having a plurality of rows can be accessed. The rows can be distributed across one or more pages in an in-memory database. Each row can be associated with a unique row position value. Each page can be associated with a capacity that is representative of an amount of data stored on the page. A capacity index having a plurality of entries can be created to record changes in capacity between pages. Neighboring entries in the capacity index can have a different capacity. Each entry in the capacity index can correspond to a page. A page directory can be created based on the capacity index. The page directory can indicate all possible row position values associated with each page. Related apparatus, systems, techniques, and articles are also described. | 2016-05-26 |
20160147905 | NAVIGATION FOR LARGE SCALE GRAPHS - In one example embodiment, a method is illustrated as retrieving a plurality of search queries and defining relationships between search queries in the plurality of search queries based on semantic data associated with the search queries. A visual representation of the of the plurality of search queries may be generated and the visual representation may be partitioned into a plurality of tiles, each title representing a predefined portion of the visual representation. | 2016-05-26 |
20160147906 | Transaction Control Block for Multiversion Concurrency Commit Status - Disclosed herein are system, method, and computer program product embodiments for utilizing a transaction control block for providing reader-writer access to transaction commit status. An embodiment operates by receiving a row read request and determining that the row is versioned. The system determines that a first timestamp information for a row destroy transaction associated with the row exists in a transaction control block and retrieves the first timestamp information from the transaction control block. | 2016-05-26 |
20160147907 | METHOD AND CAD SYSTEM FOR VERIFYING DESIGN CHANGES OF COMPONENTS BASED ON CAD PLATFORM - A method for verifying design changes of components based on a CAD platform is utilized to graphically show differences between previous and current versions of a 3D component. The method includes the following steps performed by a computer: sequentially comparing a plurality of design features of the previous and current versions of the 3D component; distinguishing a feature difference and showing it in a list on a page; altering a filename of the previous version; assembling the 3D component of the previous version whose filename is altered and the 3D component of the current versions in a single assembly to form a 3D drawing; and generating a link corresponding to the feature difference, so that the corresponding feature can be displayed on the 3D drawing when clicking on the feature difference on the page. A CAD system is also provided. | 2016-05-26 |
20160147908 | 3D MODEL COMPONENT COMPARING SYSTEM AND METHOD THEREOF - A 3D model component comparing system and method thereof are provided. The 3D model component comparing system includes a capturing unit, a setting unit, a processing unit and a prompting unit. The capturing unit acquires a first model and a second model. The setting unit sets a 3D absolute coordinate into the first model and the second model. The processing unit compares a plurality of components between the first model and the second model in the 3D absolute coordinate and determines whether coordinate values of the plurality of components which have the same component names between the first model and the second model are not identical. The prompting unit outputs a prompting message if the coordinate values of the plurality of components, which have the same component names, between the first model and the second model are not identical. Thus design error rate is reduced. | 2016-05-26 |
20160147909 | 3D MODEL COMPONENT COMPARING SYSTEM AND METHOD THEREOF - A 3D model component comparing system and method thereof are provided. The 3D model component comparing system includes a model-capturing unit, a processing unit, and a message-prompting unit. The model-capturing unit obtains a first model and a second model in a model design interface. The processing unit determines whether a plurality of component data of a plurality of components in components, which have the same component names, between the first model and the second model are all accordingly identical. The message-prompting unit outputs a renaming prompting message if the plurality of component data of the plurality of components in the components which have the same component names between the first model and the second model are not all accordingly identical. Thus design error rate is reduced. | 2016-05-26 |
20160147910 | Device Placement Automatic Calculation Apparatus - In a three-dimensional model design assistance system in which design rules are registered in advance, it is difficult to manually input all of an enormous number of device placement rules including the distances and directions between respective devices in a design. Information relating to the relative distances and relative directions between respective devices included in performance CAD data is extracted. With respect to each of the extracted relative distances and relative directions in a plurality of cases, a correlation with a performance requirement specification value, and a placement priority are calculated and held as device placement rules. At design time, requirement specifications are inputted, accessory devices are determined, and thereafter the devices are placed according to placement priorities on CAD on the basis of the device placement rules. | 2016-05-26 |
20160147911 | TECHNIQUE FOR GENERATING A SPECTRUM OF FEASIBLE DESIGN SOLUTIONS - A design application generates feasible engineering designs that satisfy criteria associated with a particular engineering problem. The design application receives input that outlines a specific engineering problem to be solved, and then synthesizes a problem specification based on this input. The design application then searches a database to identify different classes of approaches to solving the design problem set forth in the problem specification. The design application then selects one or more such classes of approaches, and generates a spectrum of potential design solutions for each such approach. The generated solutions may then be evaluated to determine the degree to which the problems specification has been met. | 2016-05-26 |
20160147912 | DESIGN SPACE FOR MATERIALS SELECTION - A design application generates a spectrum of design options that meet certain design criteria. Each design option may potentially be composed of a different type of material. The design application filters the spectrum of design options for presentation in a graphical user interface (GUI). The GUI illustrates different design options based on material of composition within a parallel axis plot that includes separate axes for different material attributes. The GUI also displays envelopes of design options for each different material or material type, where each envelope has a different color, pattern, opacity, or other visual attribute. A GUI engine dynamically updates the GUI to reflect constraints and other design criteria applied to the spectrum of design options. | 2016-05-26 |
20160147913 | APPROACH FOR GENERATING AND EXPLORING A DESIGN SPACE - A design application allows an end-user to define an engineering problem, and then synthesizes a spectrum of design options that solve the engineering problem. The design application then generates various tools to allow the end-user to explore that spectrum of design options. The design application allows the end-user to compare various attributes of each design option, and to filter the spectrum of design options based on those attributes. In response to end-user selections of certain design options, the design application identifies other similar design options, and then displays these design options to the end-user. | 2016-05-26 |
20160147914 | TECHNIQUE FOR GENERATING APPROXIMATE DESIGN SOLUTIONS - A design application interacts with an end-user to generate design problem geometry that reflects a design problem to be solved. Various design objectives, design constraints, boundary conditions, and other design criteria may be associated with the design problem geometry via the design application. When the design problem is sufficiently well defined, a client-side solver generates a solution approximation using a coarse multi-objective solver. The client-side solver favors speed over accuracy, and so the solution approximation provides only a rough representation of various attributes of potentially feasible design solutions. Based on the solution approximation, the end-user may correct any omissions, mistakes, and so forth, before executing pay-per-service cloud-based parallel solver. | 2016-05-26 |
20160147915 | Systems and Methods for Detecting and Modeling Curb Curves in Complex Urban Scenes - Computer-implemented methods and systems of detecting and modeling curbs include receiving a cloud of three-dimensional (3D) data points acquired along street locations. A plurality of vertical scanlines (e.g., arrays of 3D data points obtained at given horizontal locations) are identified within the cloud of 3D data points. One or more curb points indicating the potential presence of a curb in the plurality of vertical scanlines are identified. A synthesized set of non-overlapping curb curves are generated in order to close gaps between certain curb points while removing certain other outlier curb points. Successive curb curves in the synthesized set of non-overlapping curb curves are then identified as belonging to one or more curb segments. A curb model that fits each of the one or more curb segments to one or more curb model shape representations can then be generated. | 2016-05-26 |
20160147916 | ENHANCED PARAMETER TUNING FOR VERY-LARGE-SCALE INTEGRATION SYNTHESIS - A method and system are provided for tuning parameters of a synthesis program for a design description. The method includes (a) ranking individual parameter impact by evaluating a design-cost function of each of the parameters. The method further includes (b) creating a set of possible parameter combinations that is ordered by an estimated-cost function. The method additionally includes (c) selecting, from the set of possible parameter combinations, top-k scenarios having best estimated costs to form a potential set, and running at least some of the top-k scenarios in parallel through the synthesis program. The method also includes (d) repeating steps (b)-(c) for one or more iterations until at least one of a maximum iteration limit is reached and an exit criterion is satisfied. | 2016-05-26 |