25th week of 2017 patent applcation highlights part 57 |
Patent application number | Title | Published |
20170177665 | SELF-DESCRIBED QUERY EXECUTION IN A MASSIVELY PARALLEL SQL EXECUTION ENGINE - A query is executed in a massively parallel processing data storage system comprising a master node communicating with a cluster of multiple segments that access data in distributed storage by producing a self-described query plan at the master node that incorporates changeable metadata and information needed to execute the self-described query plan on the segments, and that incorporates references to obtain static metadata and information for functions and operators of the query plan from metadata stores on the segments. The distributed storage may be the Hadoop distributed file system, and the query plan may be a full function SQL query plan. | 2017-06-22 |
20170177666 | GENERATING A NATIVE ACCESS PLAN FOR SEMI JOIN OPERATORS - Disclosed herein are system, method, and computer program product embodiments for generating a native access plan for semi join operators. An embodiment operates by generating a plurality of variables based upon the positions of a plurality of operators in a compiled query plan, opening and traversing tables as the query plan is executed, and closing those tables based on the rows queried and the plurality of variables. | 2017-06-22 |
20170177667 | PARTITIONED JOINS IN ANALYTICAL DATABASES - A first data table and a second table to be joined is determined. The first data table and the second data table have a join attribute. Data blocks of the first data table are stored on a storage device. An attribute value information for the join attribute for the data block of the first data table is determined. At least one partition for the first data table and the second table is defined using at least he attribute value information on the join attribute. Each partition of the at least one partition has a respective partition range of values of the join attribute. A pair wise partition join is processed on a first partition range of the determined partition ranges. | 2017-06-22 |
20170177668 | RUNTIME OPTIMIZATION FOR MULTI-INDEX ACCESS - Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and an RID results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold. | 2017-06-22 |
20170177669 | RUNTIME OPTIMIZATION FOR MULTI-INDEX ACCESS - Optimization of a multi-index database access at runtime. A processor receives a query. A processor determines a plan and a record identifier (RID) results threshold for the plan, wherein the plan includes an access to the index. A processor determines a static risk threshold, a static risk for the access, and whether the static risk exceeds the static risk threshold. Responsive to the static risk exceeding the static risk threshold, a processor determines a risk bound for the access, and links the access to the risk bound. A processor accesses the index with the key. Responsive to the access being linked to a risk bound, a processor determines a dynamic risk for the access. A processor receives one or more RID results during the execution of the plan. A processor aborts the execution of the plan if a quantity of the RID results is less than the RID results threshold. | 2017-06-22 |
20170177670 | DATABASE QUERYING APPARATUSES, METHODS FOR QUERYING A DATABASE, AND NON-TRANSITORY TANGIBLE MACHINE-READABLE MEDIA THEREOF - Database querying apparatuses, methods for querying a database, and non-transitory tangible machine-readable media thereof are provided. The database querying apparatus includes receives a query including an adjective, an attribute, and a dataset name. The database querying apparatuses is stored with a fact dataset, which is defined with the attribute and at least one data field. The fact dataset includes at least one fact record. Each fact record includes an attribute value corresponding to the attribute and a list of data corresponding to the at least one data field. The database querying apparatuses accesses the fact dataset according to the dataset name, divides the fact dataset into several groups according to the attribute values, apply the operation corresponding to the adjective to each group to derive several sub-results, and generate the final result for the query from the sub-results. The operation corresponds to the adjective. | 2017-06-22 |
20170177671 | CONTROLLED REFERENCE PROCESS EXTENSIBILITY FRAMEWORK - The disclosure generally describes computer-implemented methods, software, and systems, including a method for querying extension point information and providing extension patterns for core process models. Information for a core process model user interface is provided to a client device for displaying a core process model as a visualization including core process model steps and dedicated extension points for inserting user-defined extensions. The information is provided by a server from a core process model meta-model. Selections of the extension points and customization of extensions associated with the extension points are received from a client device. A core process model instance including the core process model and customizations of the extensions is stored. Information is provided for use at the client device for presenting a process extension query interface. A query is received from the client device. Query results are identified and provided for presentation in the process extension query interface. | 2017-06-22 |
20170177672 | FLEXIBLE TEXT SEARCHING FOR DATA OBJECTS OF OBJECT NOTATION - Flexible text searching for data objects can be implemented. For example, inexact matching of key name terms can be supported. An inverted index can be used to find data objects having key names with terms that are a superset of the key name term being searched. A similar index can be used for values, and the search results can be determined via an intersection. Pattern searching and other features can be supported. Text searching for schema-less collections of data objects can be supported for use in enterprise computing scenarios. | 2017-06-22 |
20170177673 | GUIDELINES FOR CONTENT PUBLISHING IN A SOCIAL NETWORK - In an approach for providing guidelines to a user for content publishing in a social network, a processor receives initialization of a composition of a post to a first group of a social network. A processor retrieves information from the first group of the social network. A processor analyzes the information. A processor provides a guideline based on the analysis, wherein the guideline includes at least one recommendation as to how to formulate the post. | 2017-06-22 |
20170177674 | METHOD, COMPUTER-READABLE STORAGE DEVICE AND APPARATUS FOR UTILIZING COMPANION AND EVENT INFORMATION - Methods, computer-readable storage media and apparatuses for utilizing privacy information to improve a user experience are disclosed. A processor receives privacy information of a user, the privacy information comprising location information and at least one of: traveling companion information and event information, receives over a communication network associated with the network service provider, a search request, determines search results responsive to the search request, wherein the search results are generated by accounting for the location information and at least one of: the traveling companion information and the event information, and provides over the communication network associated with the network service provider, the search results to an endpoint device of the user. | 2017-06-22 |
20170177675 | Candidate Answer Generation for Explanatory Questions Directed to Underlying Reasoning Regarding the Existence of a Fact - A mechanism is provided for generating candidate answers to an explanatory question. Responsive to identifying an input question as the explanatory question, the explanatory question is decomposed into one or more explanatory queries. One or more passages are identified within a corpus of information that comprises an explanatory clause that provides an explanatory answer to the explanatory question based on pre-determined explanatory clause terms. Hypothesis evidence is received with one or passages comprising explanatory clauses from the corpus of information. One or more candidate explanatory answers are generated based on hypothesis evidence. The candidate explanatory answers are ranked and merged. Finally, the candidate explanatory answers are output. | 2017-06-22 |
20170177676 | DYNAMIC ANALYSIS OF ENTITIES - In dynamic analysis of entities, a dataset including a set of entities and a corresponding set of parameters with values are received in an analytics application. An input for shortlisting an entity for a first position is received. Weights are assigned to the set of parameters based on a first set of criteria iteratively. Weighted values based on the weights and the values for the set of parameters are computed. Weighted average corresponding to the set of entities are computed. The set of entities in descending order of the weighted average are sorted. A first entity from the sorted set of entities in a user interface as a shortlisted entity for the first position is rendered. | 2017-06-22 |
20170177677 | QUERY TASK PROCESSING BASED ON MEMORY ALLOCATION AND PERFORMANCE CRITERIA - Described are methods, systems and computer readable media for query task operations based on memory allocation and performance criteria. | 2017-06-22 |
20170177678 | SYSTEMS AND METHODS OF GENERATING A PLURALITY OF DATA VISUALIZATIONS IN A DATA VISUALIZATION REGION - An exemplary method of generating a plurality of data visualizations comprises displaying a graphical user interface that includes a schema information region and a data visualization region. The method further includes receiving user actions to associate first, second, and third fields included in the schema information region with a plurality of shelves of the data visualization region. The method further includes generating a plurality of data visualizations in the data visualization region in accordance with the received user actions, each data visualization includes a plurality of data marks corresponding to a respective retrieved tuple of data having the first, second, and third fields. Moreover, each of the data marks has an x-position and y-position defined according to data for the first and second fields, respectively. In addition, each of the data visualizations corresponds to a respective unique value of the third field, and is displayed in a respective pane. | 2017-06-22 |
20170177679 | SYSTEMS AND METHODS FOR DISPLAYING ESTIMATED RELEVANCE INDICATORS FOR RESULT SETS OF DOCUMENTS AND FOR DISPLAYING QUERY VISUALIZATIONS - Systems and methods for displaying estimated relevance indicators for result sets of documents and for displaying query visualizations are disclosed. A method includes receiving a search query including a plurality of query terms. The method further includes searching a database using the search query to identify the result set of documents and calculating an estimated relevance score for the result set of documents. The estimated relevance score is indicative of a degree to which the result set of documents are relevant to the search query. The method further includes providing for display the estimated relevance indicator based on the estimated relevance score. The estimated relevance indicator provides a visual indication of the degree to which the result set of documents are relevant to the search query. Query visualizations including a plurality of nodes and a plurality of connectors are also disclosed. | 2017-06-22 |
20170177680 | METHOD AND SYSTEM FOR LIMITING SHARE OF VOICE OF INDIVIDUAL USERS - In various example embodiments, a system and method for limiting shares of voice of individual users in a result set are provided. In example embodiments, for each publication of a plurality of publications in a set, an entity associated with the publication is identified. Using a sorting criteria, a sorted set is generated by sorting the plurality of publications in accordance with the sorting criteria by shifting a particular publication from the same entity one or more positions in order to satisfy the sorting criteria. The sorted set is provided to a searching user. | 2017-06-22 |
20170177681 | Graph Database Querying and Visualization - Embodiments provide for querying and visualization of query results of graph data. An engine processes graph data to create metadata (e.g., in JSON format) identifying at least different node types and edge types that are present in a graph database. An overview visualization simplifies presentation of graph data by depicting only various different node types and graph types. The overview visualization may form the basis for formulating queries including the metadata, which are then promulgated to the graph database. Returned query results may be visualized as an overview or on a detailed node level, promoting insight and formulation of additional queries including node/edge type metadata. The engine may convert graph data query results into tabular form for consumption by relational database analytical tools. According to particular embodiments, an engine of an in-memory database may be particularly suited to perform graph data visualization, querying, and/or tabular conversion tasks. | 2017-06-22 |
20170177682 | SYSTEM AND METHOD FOR TRANSLATING VERSIONED DATA SERVICE REQUESTS AND RESPONSES - A system for translating versioned data service requests and responses is provided. A service request for data may have multiple different versions, with each version requesting different types of data. The system may be configured to translate a service request having a versioned format into a service request having a baseline format. The system may execute the service request in the baseline format to generate a service request response, containing the data requested. The system may also be configured to translate the service request response from a baseline response format back into the versioned data service response format of the original request. | 2017-06-22 |
20170177683 | ANONYMIZATION SYSTEM - According to one embodiment, there is provided an anonymization system including at least one encryption apparatus, an anonymization apparatus, and a decryption apparatus. The encryption apparatus store personal data including one or more values for each item, and generates encrypted data from the personal data by encrypting the one or more values for each item included in the personal data. The anonymization apparatus generates encrypted anonymized data from the encrypted data without decryption by anonymizing one or more values for at least a portion of the items of the encrypted data. The decryption apparatus generates anonymized data from the encrypted anonymized data by decrypting the encrypted anonymized data. | 2017-06-22 |
20170177684 | Adaptive Payload Management - Embodiments relate to payload storage format for storing data in support of an aggregation function. As an input is subject to aggregation, the input is evaluated to ascertain a payload format for the aggregation. It is understood that there is more than one payload format. An evaluation of the aggregation key is a factor in the initial payload format. If the key is an addition to an existing aggregation, the evaluation considers changing the format of the payload to address processing and/or memory efficiency for the aggregation. The evaluation and the format change takes place dynamically so that the aggregation may continue. | 2017-06-22 |
20170177685 | SMART ELASTIC SCALING BASED ON APPLICATION SCENARIOS - Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario. | 2017-06-22 |
20170177686 | PROPERTY MODELS ON MOBILE DEVICES - A method for synchronizing business data in a networked or cloud computing arrangement between a model-based business application server and a client-side computing device, which can operate in either online or offline modes, involves providing, on the client-side computing device, a copy of a property model used on the server-side by the application server to process business data. The method further includes, when the client-side computing device is offline, processing locally stored business data on the client-side computing device with reference to the copy of the property model, and later, when the client-side computing device comes online, synchronizing the locally stored business data on the client-side computing device and business data stored on the application server side. | 2017-06-22 |
20170177687 | SYNCHRONIZATION OF OFFLINE INSTANCES - An enterprise system which facilitates synchronization of offline data. Offline data created during an offline session or sessions (collectively an offline session) prior to synchronization is assigned a temporary key. Changes of offline data created during an offline session is assigned the temporary key of the data to which the change is associated. The temporary key is mapped to a new created backend key and stored in a mapping table. Using the mapping table, temporary keys associated with the changes are swapped with backend keys which the temporary keys are mapped. This maintains data persistency of newly created and change data during an offline session. | 2017-06-22 |
20170177688 | MANAGING CONTENT ACROSS DISCRETE SYSTEMS - Disclosed are systems, methods, and non-transitory computer-readable storage media for managing content across discrete systems. A content management system can be implemented to manage content items and synchronize content items across devices. A content collaboration system can be implemented to generate documents and facilitate collaboration on documents. To take advantage of the content management system's functionality to manage and synchronize content items while also providing the collaboration functionality of the content collaboration system, the content management system can store and manage references to documents created in the content collaboration system. The document references can be managed by the content management system such that the document references appear to users as if the document references were the referenced document in the collaboration system. | 2017-06-22 |
20170177689 | Hierarchical Coherency Log for Managing a Distributed Data Storage System - A system and method for managing distributed coherent datasets using a hierarchical change log is provided. In some embodiments, a distributed storage system is provided that includes a primary storage device containing a primary dataset and a mirror storage device containing a mirror dataset. The mirror dataset includes a coherent copy of the primary dataset. The distributed storage system further includes a hierarchical change log tracking a coherence state for the mirror dataset. The hierarchical change log includes a first sub-log and a second sub-log, and a block range of the first sub-log overlaps a block range of the second sub-log. The hierarchical change log may define a priority relationship between the first sub-log and the second sub-log governing the overlap. The first sub-log and the second sub-log may be independently configured and may be different in one of a representation and a block size. | 2017-06-22 |
20170177690 | DATA SYNCHRONIZATION ERROR RESOLUTION - A synchronization protocol is provided that can be used to resolve synchronization errors encountered while trying to synchronize versions of data objects between a client device and a remote computing system. The protocol includes a client device, in an offline processing mode, handling user interface (“UI”) manipulation actions on one or more UI elements of one or more UI screens. The handling of the UI manipulation actions modifies or creates a local version of a data object stored on the client device. The UI manipulation actions are stored by the client device and sent to the remote computing system. The client device receives a synchronization error notification from the remote computing system. After receiving the notification, the client device displays, in one of the UI screens, the local version of the data object and one or more indications of a synchronization error. | 2017-06-22 |
20170177691 | WORKLOAD DISCOVERY USING REAL-TIME ANALYSIS OF INPUT STREAMS - Provided are techniques for workload discovery using real-time analysis of input streams. For a meta workload, changes to data objects made by change operations that are in a replication change stream are stored into a recovery log. Using an analytics engine, one of the recovery log and the replication change stream are analyzed to identify associations between the data objects based on usage and access patterns. The associations are used to identify sub-workloads of the meta workload that form consistency groups for replication. | 2017-06-22 |
20170177692 | ARRANGEMENT FOR SYNCHRONIZING MEDIA FILES WITH PORTABLE DEVICES - Arrangements are provided which improve the efficiency of the synchronization process. The same ensure that synchronizations of large quantities of content can be completed with a minimum of delay. One method prioritizes the various tasks that are to be performed prior to synchronization. Another method initiates dependent tasks while parsing a synchronization tasks list. Yet another method allows modification of an in-process synchronization operation to allow new synchronization tasks to be accomplished within the context of the same process, negating the need to restart synchronization. | 2017-06-22 |
20170177693 | SYNCHRONIZATION ADAPTER FOR SYNCHRONIZING DATA TO APPLICATIONS THAT DO NOT DIRECTLY SUPPORT SYNCHRONIZATION - A synchronization adapter is coupled to the application that does not support synchronization and generates the necessary synchronization metadata for all data in the application that is to be synchronized. The synchronization adapter then combines the metadata to the actual data to be synchronized to form a synchronization feed. The synchronization feed is stored in an internal cache (or data store) which is internal to the application, or an external cache (or data store), which is external to the application, or it can be stored in both caches. The synchronization adapter also intermittently determines whether the application data has changed, thus warranting a change in its metadata, or whether a synchronization operation is warranted to synchronization operation is warranted to synchronize the data with data in another application. In either case, the synchronization adapter makes the changes to the data, or performs a synchronization operation. | 2017-06-22 |
20170177694 | SYSTEM AND METHOD FOR MAINTAINING DEVICE STATE COHERENCY - Embodiments of the invention are directed to systems and methods for maintaining coherency between different entities in a distributed system. A coherency module automatically detects a change in state in a first entity, wherein the change in state relates to a change in functional code in the first entity. A synchronization message is transmitted to a second entity to synchronize data in the second entity with data in the first entity as a result of the change in state, The second entity is configured to synchronize the data in the second entity with the data in the first entity after receiving the synchronization message. | 2017-06-22 |
20170177695 | SYNCHRONIZATION OF OFFLINE DATA - A method includes initiating, at backend server, a process for synchronization of a data record stored locally on a client computing device with a corresponding data record stored in a backend database. The synchronization process includes comparing the hash value of the data record stored locally on the client computing device and the hash value of the corresponding data record stored in the backend database, and based on the comparing, sending information about the corresponding data record stored in the backend database to the client computing device, if needed for updating the data record stored locally on the client computing device. | 2017-06-22 |
20170177696 | USAGE OF MODELED VALIDATIONS ON MOBILE DEVICES IN ONLINE AND OFFLINE SCENARIOS - According to various embodiments, systems and methods for validating transactions on a client device when it is operating in an offline mode are presented. According to the disclosure, the client device may receive an initial data synchronization from a server to generate a local copy of data. Additionally, the client device may receive a validation model from the server based on a set of validation rules. The client device may receive an indication to update a local copy of the data while the client device is operating in an offline mode. The indicated update to the local copy may be validating using the validation model. If successfully validated, the local copy of the data may be updated. When the client device enters an online mode, the local copy of the data can be synchronized with the server. | 2017-06-22 |
20170177697 | DISTRIBUTED DATABASE TRANSACTION PROTOCOL - Technologies are described for facilitating transaction processing within a database environment having a coordinator node, a first worker node, and at least a second worker node. The coordinator node receives local transaction tokens from the first and the at least a second worker nodes. The coordinator nodes determines a synchronized transaction token using at least the local transaction tokens from the first and the at least a second worker nodes. The coordinator node sends the synchronized transaction token to the first and the at least a second worker nodes. | 2017-06-22 |
20170177698 | DECENTRALIZED TRANSACTION COMMIT PROTOCOL - Technologies are described for facilitating transaction processing within a database environment having first, second, and third database system nodes. In the database system, the first database system node receives from the second database system node a request to precommit a first database transaction. The first database system node stores information for the first database transaction that includes an indication that the second database system node coordinates the committing of the first database transaction. The first database system node receives from the third database system node a request to precommit a second database transaction. The first database system node stores information for the second database transaction that includes an indication that the third database system node coordinates the committing of the second database transaction. | 2017-06-22 |
20170177699 | SIZE-OPTIMIZED DATA INTERCHANGE METHOD AND SYSTEM - Disclosed herein is an optimized data interchange system, method and architecture. An original data interchange document, such as a JavaScript™ Object Notation (JSON) document, comprising a number of name/value pairs is separated, or split, into a template document and a data document for separate transmission. The two documents can be recombined at a destination computing device. | 2017-06-22 |
20170177700 | UPDATING A PARTITIONING COLUMN - An update to a partitioning column for a partitioned table in a database can be performed by handling rows for which the update will not require moving to a different partition separately (e.g. “locally”) for each partition followed by re-inserting those rows that will require moving to a different partition and deleting them from the original partition. The re-inserted rows are directed to a correct partition by application of the partitioning criteria for the table. Methods, articles, and systems are described. | 2017-06-22 |
20170177701 | SYSTEMS AND METHODS FOR SMART ANALYTICS INTERFACE - According to some embodiments, a communication port may receive electronic messages containing business intelligence elements, key figures, and a stream of big data. A smart analytics platform may automatically execute a context determination tool, an expert knowledge tool, and a data interpretation tool using the business intelligence elements, key figures, and stream of big data. The smart analytics platform may then render a smart analytics interface display on a remote user device via a distributed communication network. The smart analytics interface display may, for example, include outputs of the context determination tool, expert knowledge tool, and data interpretation tool. | 2017-06-22 |
20170177702 | GENERATION AND HANDLING OF SITUATION OBJECTS - Techniques for identifying a knowledge graph including one or more objects; generating a situation definition based on the knowledge graph, the generating including: identifying a particular object of the one or more objects; determining a trigger condition associated with the particular object; determining related information based on the one or more objects; determining one or more actions associated with the one or more objects and based on: i) the trigger condition, and ii) the related information; associating the trigger, the related information, and the one or more actions with the situation definition; and associating the situation definition with criteria for assignment to one or more user profiles. | 2017-06-22 |
20170177703 | AUTOMATIC TAXONOMY MAPPING USING SEQUENCE SEMANTIC EMBEDDING - In accordance with an example embodiment, an automated taxonomy mapping system that uses sequence semantic embedding techniques is described. Sequence sematic embedding models are used to generate the sequence vectors. The sequence semantic embedding models are trained offline and can be shared across different systems having different taxonomies and various versions of a category taxonomy. | 2017-06-22 |
20170177704 | SIMILARITY IN A STRUCTURED DATASET - Detecting similarity in a structured dataset is disclosed. One example is a system including a converter, and an evaluator. A structured dataset is received via a processing system, the dataset including a plurality of objects, each object of the plurality of objects associated with a category, and each category associated with an object label. The converter converts, for each object of the plurality of objects, the object label into a semantic term, The evaluator determines, via the processing system, a term similarity for a pair of object labels in a given category, the term similarity indicative of a correlation between the respective semantic terms in the given category. | 2017-06-22 |
20170177705 | CLUSTERING USING LOCALITY-SENSITIVE HASHING WITH IMPROVED COST MODEL - Embodiments are disclosed for using an improved locality sensitive hashing (LSH) operation for the K-means clustering algorithm. In some embodiments, parameters of an LSH function are optimized with respect to a new cost model. In other embodiments, an LSH operation is applied with optimized parameters to a K-means clustering algorithm. | 2017-06-22 |
20170177706 | Category-Based Search System and Method for Providing Application Related Search Results - A method is provided and includes: receiving at a processor of a user device a search query for an application; and obtaining search results based on the search query. Each of the search results includes: access information including a reference to an application executable on the processor and indicating an operation for the application to enter an operating state, where the application provides content related to the search query while in the operating state; a category; and a tag indicating a function of the application. The method further includes: displaying a search result objects; displaying a category or a tag for each category or tag represented in the search results; receiving an input indicating one of the categories or tags, which has been selected; and based on the selected category or tag, displaying a subset of the search results corresponding to the one of the categories or tags. | 2017-06-22 |
20170177707 | DISPLAY OF RELEVANT INFORMATION FROM MULTIPLE DATA SOURCES - The present disclosure provides methods, devices, systems, and computer program products for displaying relevant information related to user roles from multiple data sources and in multiple application environments. Also provided are methods, devices, systems, and computer programs for collecting and compiling information, data, and content from one or more sources according to a user's domains, roles, and/or sub-roles. | 2017-06-22 |
20170177708 | TERM WEIGHT OPTIMIZATION FOR CONTENT-BASED RECOMMENDER SYSTEMS - A system, a machine-readable storage medium storing instructions, and a computer-implemented method are described herein are directed to a Term Weight Engine that defines a pairing comprising a user profile text section paired with a job post text section. The Term Weight Engine learns a pairing weight indicating an extent that a similarity of text in the pairing predicts a relevance of a respective job posting to a given user profile. The Term Weight Engine learns a global weight for a term(s). The Term Weight Engine calculates a similarity score of the pairing as between a first user profile of a target member account and a first job posting. Based on identifying the term appears in the pairing as between a first user profile of a target member account and a first job posting, the Term Weight Engine applies the global weight to the similarity score to generate a prediction indicating whether the target member account will apply to the first job posting. The Term Weight Engine determines whether to send a recommendation | 2017-06-22 |
20170177709 | DECISION TABLE DECOMPOSITION USING SEMANTIC RELATIONS - A computer-implemented method for decomposing a decision table includes decomposing, by a computer processor, a decision table into a first sub-table and a second sub-table. The decision table includes two or more columns, and the decomposition is based on a semantic model describing relations among the two or more columns of the decision table. The first sub-table and the second sub-table together represent the decision table. | 2017-06-22 |
20170177710 | METHOD AND APPARATUS FOR PROVIDING NATURAL LANGUAGE INPUT IN A CARTOGRAPHIC SYSTEM - An approach is provided for classifying natural language input into plurality of query processing levels. The approach involves parsing at least one natural language input into one or more words, wherein the at least one natural language input represents at least one cartographic query. The approach also involves mapping the one or more words to at least one function of a cartography system. The approach further involves determining an availability of the at least one function, one or more parameters associated with the at least one function, or a combination thereof with respect to at least one component of the cartography system. The approach also involves classifying the at least one cartographic query into at least one of a plurality of query processing levels based, at least in part, on the availability. The approach further involves initiating an execution of the at least one function at the classified at least one query processing level, wherein the execution of the at least one function generates one or more results of the at least one cartographic query based, at least in part, on the one or more parameters. The approach also involves causing, at least in part, a presentation of the one or more results as cartographic information in a user interface of the cartography system. | 2017-06-22 |
20170177711 | Semantic Layer for Processing Machine Data - Improved techniques for processing machine data are disclosed. Embodiments are operable to receive machine data input, interpret its meaning, and then represent that meaning in a knowledge base that grows over time with each new entry. The knowledge base enables extension of both syntax and lexicon, which are the main determinants of meaning. As new entries are added, the knowledge in the knowledge base grows. Over time, the knowledge base acquires more meaning. The disclosed machine data processing system includes entry type recognition, mapping entry types to semantic events, and building entries in the knowledge base based on the semantic event-entry type mapping. Data generated by this process may be used to conduct searches for patterns of semantic events across multiple different machine data sources. This information may then be used to perform useful work such as detecting security threats, identifying operational problems, or tracking customer purchases, etc. | 2017-06-22 |
20170177712 | SINGLE STEP CROSS-LINGUISTIC SEARCH USING SEMANTIC MEANING VECTORS - System and methods for clustering courses based on recorded member records are disclosed. The server system receives a search query in a first language. The server system generates a semantic meaning vector associated with the search query. The server system accesses a plurality of semantic meaning vectors associated with item records, wherein at least some of the item records are not written in the first language. For each respective semantic meaning vector associated with item records, the server system compares the semantic meaning vector with the semantic meaning vector associated with the search query and selects item records based on the comparison. For each selected item record the server system determines whether the item record is written in the first language and if so, automatically translates the item record into the first language. The server system transmits the one or more selected item records to the client system for display. | 2017-06-22 |
20170177713 | Systems and Method for Searching an Index - Representative embodiments form an information set from a current set of index information available by operations of the pre-search and runtime search components of the search engine. A search request that contains search terms and/or other search criteria (e.g., date or file type) is entered by a user through an input interface. The search terms and the information set are worked through the search engine modules to provide results sought by the user. The results are provided to the user via an output interface. Embodiments involve converting a search request into a format of an index of documents, and then comparing the converted search request and the index for matches. | 2017-06-22 |
20170177714 | AUTOMATIC NEW CONCEPT DEFINITION - According to an aspect, automatically adding new concepts to a concept graph includes receiving a string of text, searching a corpus of data to locate additional text related to the string of text, and extracting concepts from the additional text. The extracted concepts include a subset of concepts in the concept graph. The adding new concepts also includes determining whether the string of text should be linked to an existing concept in the concept graph, performing the linking based on determining that the string of text should be linked to the existing concept in the concept graph and, based on determining that the string of text should not be linked to an existing concept in the concept graph, adding a new concept to the concept graph. The new concept is associated with the string of text. | 2017-06-22 |
20170177715 | Natural Language System Question Classifier, Semantic Representations, and Logical Form Templates - Natural language system question classifier, semantic representations, and logical form template techniques and systems are described. In one or more implementations, a natural language input is classified as corresponding to respective ones of a plurality of classes of questions. A semantic intent of the natural language input is extracted as a semantic entity and a semantic representation. Question classification labels that classify the question included in the natural language input is then used to select at least one of a plurality of logical form templates. The semantic intent that is extracted from the natural language input is then used to fill in the selected logical form templates, such as to fill in entity, subject, predicate, and object slots using the semantic entity and semantic representation. The filled-in logical form template is then mapped to form a database query that is then executed to query a database to answer the question. | 2017-06-22 |
20170177716 | TECHNOLOGIES FOR SEMANTIC INTERPRETATION OF USER INPUT BY A DIALOGUE MANAGER - Technologies for interpreting an input from a user of a compute device are disclosed. The compute device may capture input data from, for example, a microphone. The compute device is configured to recognize the speech in the input data, and determines one or more semantic interpretations of the input data. The compute device ranks the semantic interpretations, and selects and applies one of the semantic interpretations. In ranking the semantic interpretations, the compute device may consider factors such as the dialogue history and the dialogue coherence of the semantic interpretations, as well as the confidence of how well each semantic interpretation matches the input data. | 2017-06-22 |
20170177717 | RATING A LEVEL OF JOURNALISTIC DISTORTION IN NEWS MEDIA CONTENT - A system and method for analyzing news content is provided. The method includes monitoring a plurality of third party websites; selecting a first news article from a third party website of the plurality of third party website for analysis; analyzing the first news article for a journalistic distortion; assigning a numerical value to the journalistic distortion in each instance of detection of the journalistic distortion; calculating an aggregate numerical value of the journalistic distortion based on a total of the assigned numerical values within the first news article; determining a rating for the first news article using the aggregate numerical value, wherein the rating indicates a level of journalistic distortion contained in the first news article; and providing the rating of the first news article to a user computing device. | 2017-06-22 |
20170177718 | ANALYZING USER INTERACTIONS WITH A VIDEO - Techniques are provided for aggregating data about multiple user interactions with a media (video or audio) item and analyzing the aggregated data. Based on the analysis, a recommendation and/or a report may be generated. Alternatively, one or more changes are automatically made to the media item. A recommendation indicates how the media item may be improved. The recommendation may indicate where the media item should be modified. The recommendation is then provided to a creator of the media item. A report indicates where within the media item different user interactions are occurring. If a change is automatically made to a media item, then a report may be generated that indicates a difference between user interactions before the change and after the change. | 2017-06-22 |
20170177719 | DYNAMIC VIDEO ACQUISITION BASED ON EVENT CHARACTERISTICS - In order to acquire content about an event, a collection group of users of a social network may be dynamically identified. This collection group of users may be relevant to and/or proximate to the event. For example, the collection group of users may be identified based on their user or member profiles and characteristics of the event. Then, recommendations may be provided to the collection group of the users to acquire content, such as an image or a video associated with the event. Moreover, acquired content may be subsequently presented to the users of the social network. In addition, the behaviors of the users in the social network (such as a number of views of the content and/or a duration of the views) may be used to determine the event characteristics that are the most interesting to the users, thereby improving future content acquisition. | 2017-06-22 |
20170177720 | METHOD AND SYSTEM OF SCORING DOCUMENTS BASED ON ATTRIBUTES OBTAINED FROM A DIGITAL DOCUMENT BY EYE-TRACKING DATA ANALYSIS - In one exemplary embodiment, a set of attributes derived from an element of a first digital document is obtained. The element is identified from eye-tracking data of a user viewing the digital document. A search query of a database comprising at least one query term is received. A set of documents in the database is identified according to the search query. An attribute score is determined for each document. The set of documents are sorted according to the attribute score. Optionally, a commonality between the query term and at least one member of the set of attributes ma be determined. The search query may be generated by the user. The database may be a hypermedia database. | 2017-06-22 |
20170177721 | Detecting and Using Mood-Condition Affinities - Concepts and technologies are disclosed herein for detecting and using mood-condition affinities. A processor that executes an affinity service or affinity application can obtain collected data associated with a user device. The collected data can include sensor readings collected by the user device. The processor can determine a condition at the user device and a mood associated with the condition. The processor can generate an affinity that defines a relationship between the condition and the mood and store the affinity at a data storage device. | 2017-06-22 |
20170177722 | SEGMENTING SOCIAL MEDIA USERS BY MEANS OF LIFE EVENT DETECTION AND ENTITY MATCHING - The present disclosure relates generally to the field of segmenting social media users (such as users of a social media network) by means of life event detection (such as based upon social media messages and/or postings) and entity matching. In various embodiments, systems, methods and computer program products are provided. | 2017-06-22 |
20170177723 | Systems and Methods of Sourcing Hours of Operation for a Location Entity - Computer-implemented methods and systems for sourcing hours of operation for a business or other location entity can include receiving a request to update hours of operation. A number of mobile devices present at the location entity during one or more periods of time can be determined based at least in part on a collection of time-stamped mobile device location data that identifies mobile devices associated with discrete users present at the location entity. The number of mobile devices and initial operating hours for the location entity can be provided as input to a statistical model (e.g., neural network, support-vector machine (SVM) or logistic regression model). An output of the model can indicate a likelihood that operating hours for the location entity have changed relative to the initial operating hours. The operating hours for the location entity can then be updated based at least in part on the model output. | 2017-06-22 |
20170177724 | SYSTEM FOR COLLECTING AND DISPLAYING DIAGNOSTICS FROM DIAGNOSTIC INSTRUMENTS - A system including multiple diagnostic instruments, each diagnostic instrument including a detector that interacts with a test assay is provided. At least one diagnostic instrument is configured to automatically associate the test assay with multiple values to generate a diagnostic. The diagnostic may be stored within a memory of the diagnostic instrument, and the multiple values may be related to one or more of: a test assay identifier, a test assay result, a patient identifier, and a diagnostic instrument identifier. At least one diagnostic instrument in the system may be configured to transmit the diagnostic to a first server for storage. The first server being configured to generate a report based on the diagnostic from each diagnostic instrument for display on a second server or on an end-user workstation. Methods for use the above system are also provided. | 2017-06-22 |
20170177725 | Developing An Item Data Model For An Item - The present invention extends to methods, systems, and computer program products for developing an item data model for an item. Aspects of the invention can automate the process of data collection of “facts” for “items” that information is needed about. Facts can be organized and normalized to eliminate redundant facts, and interpret what is found. Data requirements extraction and automated modeling using a combination of data virtualization, data analytics, extract, transform, and load (ETL), web crawlers, and reverse engineering systems, can be used along with other technologies to develop an item model. A model owner feeds a curating module with the information for locating the facts to be used, and initiating the modeling process. Existing data structures, websites, vendor input, etc. can be described to the import process, and an item model is produced. The model can be imported into existing modeling tools for viewing, or viewed as XML. | 2017-06-22 |
20170177726 | CONSUMPTION OF USER-FILTERED DATA ON A CLIENT DEVICE - Various techniques for consumption of user-filtered data on a client device are described herein. In one example, a method includes storing a detected filter corresponding to an object list and generating a data request based on the stored filter, wherein the data request can populate the object list. The method can also include retrieving data from a data repository based on the data request in response to a detected action, the retrieved data comprising a subset of fields corresponding to at least one object to be retrieved. Additionally, the method can include updating the object list based on the retrieved data and displaying the subset of fields of the at least one object in the object list. | 2017-06-22 |
20170177727 | METHODS FOR ANALYZING WEB SITES USING WEB SERVICES AND DEVICES THEREOF - Methods, non-transitory computer readable media, and devices that determine when a job extracted from a stack is a pending job. When the determining indicates that the job is a pending job, a web service indicated in the job is executed. Another job is extracted from a web service response, and the another job is inserted into the stack. The web service is configured to obtain a web page to be analyzed based on the URL, execute the web page in an emulated JavaScript environment, and return the web service response. When the determining indicates that the job is not a pending job, a data collector event handler indicated in the job is executed. The data collector event handler is configured to update an output resource based on content of the analyzed web page included in the job. | 2017-06-22 |
20170177728 | MENTION SUGGESTION, AND INFORMATION PROCESSING METHODS AND SYSTEMS - Mention suggestion, and information processing methods and systems are provided, e.g., for social networking. A mention suggestion method comprises: in response to a mention symbol input by a user in a first social network, acquiring a first correspondence between a first user name set and a second user name set, and historical mention information of the user; and suggesting at least one first user name in the first user name set to the user according to the first correspondence and the historical mention information. The information processing method comprises: collecting historical mention information, of a user, on a first social network and another social network, or on another social network; and storing the historical mention information. User names can be suggested more accurately when a user needs to mention a user name, so as to improve an input speed of the user. | 2017-06-22 |
20170177729 | SEARCH ENGINE AND LINK-BASED RANKING ALGORITHM FOR THE SEMANTIC WEB - A dataset ranking procedure for use in a hyperdata search engine is disclosed. A problem with known hyperdata search engines is they rank the datasets in a way that leads to prominence being given in search results to unimportant datasets. The hyperdata search engine disclosed here addresses this problem by giving extra credence to any dataset which includes the original definition of a resource which is referred to in a resource definition in another dataset. In this way, datasets which the authors of other datasets choose to refer to in their own resource definitions are given greater prominence in the results provided by a hyperdata search engine, providing a user with what he requires in order to more quickly find a dataset which provides useful information relating to his search query. In some embodiments, the reference to another dataset is found in a relationship statement including a subject, predicate and object, and the amount of extra credence given by virtue of the reference depends on the predicate found in the relationship statement. In refinements of those embodiments, the use of a more popular predicate in the relationship statements leads to the reference being given more weight. | 2017-06-22 |
20170177730 | Automatic Webpage Characterization and Search Results Filtering - Systems and methods are described for automatically analyzing and characterizing Internet search results, and removing search results from a search results page according to specific characteristics of operational function type information displayed on each webpage located at a URL corresponding to a search result. Operational function types include one or more of: a composition of information displayed on the webpage; a behavior of the webpage; a style of the webpage; an organization of the webpage; and a purpose of the webpage. | 2017-06-22 |
20170177731 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, PROGRAM, HISTORY MANAGEMENT SERVER, HISTORY MANAGEMENT METHOD, AND INFORMATION PROCESSING SYSTEM - Provided is an information processing apparatus including a selected information acquisition unit for acquiring, from a history management server managing, for each search string, one or more pieces of selected information selected from one or more pieces of page identification information obtained by using the search string, selected information matching a selected string, and a display control unit for performing control such that information regarding a page identified by the selected information acquired by the selected information acquisition unit is displayed. | 2017-06-22 |
20170177732 | RECOMMENDING CONTACTS IN A SOCIAL NETWORK - A method and system for recommending potential contacts to a target user is provided. A recommendation system identifies users who are related to the target user through no more than a maximum degree of separation. The recommendation system identifies the users by starting with the contacts of the target user and identifying users who are contacts of the target user's contacts, contacts of those contacts, and so on. The recommendation system then ranks the identified users, who are potential contacts for the target user, based on a likelihood that the target user will want to have a direct relationship with the identified users. The recommendation system then presents to the target user a ranking of the users who have not been filtered out. | 2017-06-22 |
20170177733 | TENANTIZATION OF SEARCH RESULT RANKING - This disclosure describes methods and systems for searching documents in a multi-tenant hosting environment. According to embodiments, to conserve hardware resources, a plurality of documents associated with a plurality of tenants may be mapped to the same search index in the multi-tenant hosting environment. In order to search documents associated only with a single tenant in the multi-tenant hosting environment, a tenant identifier is prepended to every key stored in the search index that is associated with the plurality of documents of the single tenant. Moreover, where one document links to another document within the multi-tenant hosting environment, the link is stored in a web graph when a source tenant identifier matches a target tenant identifier for the link. According to embodiments, when conducting a search, the link is resolved only if the link is stored in the web graph. | 2017-06-22 |
20170177734 | METHOD AND SYSTEM FOR WEB PAGE BREADCRUMB - In response to receiving a request for visiting a first web task associated with a website, a first task node is generated in a tree structure at a breadcrumb root node in the tree structure. In response to sequentially receiving requests for multiple subtasks of the first web task, multiple subtask nodes of the first task node are sequentially established in the tree structure. The subtask nodes of the multiple subtask nodes of the first task node are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task. The multiple subtask nodes of the first task node are processed based a policy of the first web task. | 2017-06-22 |
20170177735 | SYSTEM AND/OR METHOD FOR LINKING NETWORK CONTENT - A system for linking network content over a communications network is provided. The system includes at least one memory or storage unit that stores and/or maintains a plurality of linked-content facilities, each linked-content facility being independently associated with a network location containing network content; at least one processor that executes software that generates, maintains and/or controls access to the linked-content facilities for a plurality of users; and, at least one input/output device that provides an interface for users to operate the software to retrieve and/or view the linked-content facilities for selected network locations from the memory or storage unit, via the communications network. The linked-content facilities stored and/or maintained on the memory or storage unit include system and/or user generated link content received from at least one user, regarding network content related to their network locations. Associated methods for linking network content for use with the system are provided. | 2017-06-22 |
20170177736 | CACHING PAGELETS OF STRUCTURED DOCUMENTS - In one embodiment, a method includes receiving a request for a web page from a client; identifying resource portions stored in a cache, each resource portion corresponding to a portion of a structured document for use by the client to render the requested web page; instructing the client to render the requested web page using the resource portions stored in the cache; and refreshing the resource portions, wherein the refreshing comprises: generating difference data, if any, for the resource portions, wherein the difference data for the resource portions indicates changes to be made to the resource portions; instructing the client to, in parallel with the generation of the difference data, render the resource portions; sending the difference data to the client; and instructing the client to, based on the difference data, update the resource portions stored in the cache and render the updated resource portions. | 2017-06-22 |
20170177737 | Method, Controller, Program, and Data Storage System for Performing Reconciliation Processing - A method for reconciling a source data graph with a target data graph, the source graph and the target graph each comprising: and a interconnections, the interconnections each connecting two vertices from and representing a relationship between the connected vertices. The method comprises: generating target event propagation information representing the propagation pattern of executions of each of a set of processing events in the target graph; receiving a request to reconcile the source and graph, and in response to the request, triggering the executions of each of the set in the source graph; generating source event propagation information representing the pattern of each of the executions triggered in the source graph; and using the target event propagation information and the source event propagation information to assess the similarity of pairs of vertices comprising one vertex from each of the source graph and the target graph. | 2017-06-22 |
20170177738 | DYNAMIC INTENT REGISTRY - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for relating the operation of applications on a user device are described including accessing, for a first application, intent data describing intent groups for the first application, each intent group including one or more intents that belong to the intent group, determining enabling connectors for the intent groups, each enabling connector specifying an enabling intent that causes a corresponding intent group to become active in the first application, generating intent group association data that associates intent groups to other intent groups by enabling connectors, wherein an enabling intent associates a first intent group to a second intent group, and the second intent group becomes active in response to an execution of the enabling connector, and providing the intent group association data to a user device that has the first application installed. | 2017-06-22 |
20170177739 | PREDICTION USING A DATA STRUCTURE - Techniques for prediction using multimap is described herein. The method for multimap prediction can include generating a user profile graph in the memory device based on user action input received at an input device. The method for multimap prediction can also include matching a user profile graph stored in the memory device to a subgraph of a multimap graph, both comprising nodes and edges, wherein each node indicates at least one of an activity input and a keyword. The method can include providing access to a multimap prediction in the memory device based on the user action input and the subgraph of the multimap graph. | 2017-06-22 |
20170177740 | SUB-GRAPH INTERFACE GENERATION - A specification including a description of a first directed graph including a first plurality of components interconnected by a first set of one or more directed links is received. A graph interface is formed for the first plurality of components including: forming a first interface element of the graph interface, the first interface element being associated with a first port of a first component of the first number of components, and configuring one or more properties of the first interface element such that the first port of the first component is consistent with the one or more properties of the first interface element. A first implementation of the graph interface is formed including the first number of components, the forming including forming a first correspondence between the first interface element and the first port of the first component of the first number of components. | 2017-06-22 |
20170177741 | ACCESSING AN N-WAY LINKED LIST - Computer-implemented methods for accessing a particular element of a plurality of elements stored in an N-way linked list in a computer memory provide for adding or removing elements at locations within the list. The methods may be employed with LIFO or FIFO N-way linked lists. The methods may include traversing the N sub-lists in parallel as well as the use of single instruction multiple data operations. | 2017-06-22 |
20170177742 | FINDING A BEST MATCHING STRING AMONG A SET OF STRINGS - A method for finding a best matching string among a set of strings for a reference string includes representing, for each of the set of strings paired with the reference string, a dynamic programming problem for calculating a final alignment score as a matrix of cells, and calculating a current optimal alignment boundary threshold. The method also includes executing, for each string of the set of strings, a calculation of a prospective final alignment score of a candidate alignment of the each of the set of strings and the reference string for each cell. Based on determining, that prospective final alignment score improves the current optimal alignment boundary threshold, the method includes calculating a final alignment score for the string of the set of strings associated with the cell. Otherwise, the method includes aborting the calculation of a candidate alignment covering the string associated with the cell. | 2017-06-22 |
20170177743 | MULTIDIMENSIONAL SPATIAL SEARCHING FOR IDENTIFYING SUBSTANTIALLY SIMILAR DATA FIELDS - A method of identifying substantially similar data fields may include accessing a first/second text strings, performing an approximate string-matching algorithm that generates a first score, and comparing the first score to a first threshold. The method also includes performing an exact string-matching algorithm that generates a second score and comparing the second score to a second threshold. The method further includes generating a third score by combining a weighted first score with a weighted second score and comparing the third score to a third threshold. The method also includes determining whether the first text string is substantially similar to the second text string based on the three score comparisons. | 2017-06-22 |
20170177744 | Graph Database Visualization by Node and Edge Type - Embodiments provide an overview visualization of graph data by rendering a graph's structure based upon different node/edge types, rather than upon a total number of nodes and/or edges. These node/edge types are recognized based upon associated metadata. The small number of different node/edge types of a typical graph reduces components for representation in the overview, simplifying that visualization and facilitating user interaction. A user can switch between the graph overview, and a different view affording node-level details. In analysis and/or querying, switching between the overview and the detailed visualization can afford natural and intuitive control over data granularity. For example the overview visualization of graph data may allow a user to initially filter on particular node types, with the subsequent node-level view permitting exploration of finer details while maintaining the overall context of the original graph. Embodiments may transform graph query results into a tables readily consumed by relational-type databases. | 2017-06-22 |
20170177745 | SCALABLE AND PRECISE FITTING OF NURBS SURFACES TO LARGE-SIZE MESH REPRESENTATIONS - One embodiment of the invention disclosed herein provides techniques for fitting a mesh representation that includes a plurality of mesh points with a NURBS surface. A subdividing engine subdivides the mesh representation into a plurality of patches in a parametric domain. A vertex solving engine computes one or more vertex boundary continuity constraints for each vertex included in a plurality of vertices associated with the plurality of patches. An edge solving engine computes one or more edge boundary continuity constraints for each edge included in a plurality of edges associated with the plurality of patches. A patch solving engine fits a first patch included in the plurality of patches with at least one partial NURBS surface based on the vertex boundary continuity constraints and the edge boundary continuity constraints. | 2017-06-22 |
20170177746 | MODEL GENERATING DEVICE, POSITION AND ORIENTATION CALCULATING DEVICE, AND HANDLING ROBOT DEVICE - A model generating device for generating a three-dimensional model of an object includes a three-dimensional measuring machine which three-dimensionally measures a plurality of objects each disposed at a given orientation in a three-dimensional space, to obtain measurement data, a model measurement data extracting unit which treats the measurement data of the plurality of objects measured by the three-dimensional measuring machine as a set of model measurement data obtained by measuring one object from a plurality of virtual measurement positions, to extract the model measurement data corresponding to the plurality of virtual measurement positions, and a model measurement data integrating unit which integrates the model measurement data extracted by the model measurement data extracting unit, to generate a three-dimensional model of each object. | 2017-06-22 |
20170177747 | Reconfigurable Spaces - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for reconfigurable spaces. One of the methods includes identifying plan information relating to a space under evaluation. Constraints related to structures associated with the plan information are identified. Input regarding uses or elements to be included in a reconfigurable design for the space is received. A library of elements for inclusion in the space is evaluated, including determining one or more reconfigurable elements that satisfy the received input. A first configuration of a reconfigurable element is determined including a first placement in a first design associated with the space, and the first design in accordance with the first configuration is presented. A second different configuration is determined, including a second placement in a second different design associated with the space, and the second different design in accordance with the second different configuration is presented. | 2017-06-22 |
20170177748 | Residential Upgrade Design Tool - A user inputs an address to a computer system, which retrieves an aerial image of the lot and identifies features visible in the image. A user selects a feature and a scanning drone is programmed with GPS coordinates of the boundary of the feature. The drone scans the feature and a model is generated. Upgrades for the feature are selected based on local weather and other factors. The model is updated according to a selected upgrade and rendered for a user. Training materials may be generated that include illustrations of the model modified to show intermediate stages of applying an upgrade. Materials required to apply the upgrade are determined from a surface area of the feature, including taking into account texture detected by scanning. | 2017-06-22 |
20170177749 | EFFICIENT DEPLOYMENT OF TABLE LOOKUP (TLU) IN AN ENTERPRISE-LEVEL SCALABLE CIRCUIT SIMULATION ARCHITECTURE - A method for conducting numerical analysis includes defining a plurality of components in a system and a condition to be analyzed, performing a table look-up for components of the plurality of components, acquiring a result for the condition to be analyzed based on information in a table in which a component of the plurality of components is defined, and conducting the analysis of the system using the result based on the information in the table for the component. | 2017-06-22 |
20170177750 | Majority Logic Synthesis - A method for optimizing an implementation of a logic circuit, comprising steps of providing an interpretation of the logic circuit in terms of 3 Boolean variable majority operators M, with each of the majority operators being a function of a plurality of variables that returns a logic value assumed by more than half of the plurality of variables, and a single Boolean variable complementation operator ′. The method further comprises providing a commutativity, a majority (Ω.M), an associativity (Ω.A), a distributivity (Ω.D), an inverter propagation (Ω.I), a relevance (Ψ.R), a complementary associativity (Ψ.C), and a substitution (Ψ.S) transformation; and combining the Ω.M, Ω.C, Ω.A, Ω.D, Ω.I, Ψ.R, Ψ.C and Ψ.S transformations to reduce an area of the logic circuit via (i) a reshaping procedure consisting of the Ω.A, Ω.C, Ω.D, Ω.I, Ψ.R, Ψ.S and Ψ.C transformations, applied either left-to-right or right-to-left moving identical or complemented variables in neighbor locations of the logic circuit, (ii) an elimination procedure consisting of the Ω.M transformation, applied left-to-right, and the Ω.D transformation, applied right-to-left, that simplify redundant operators, or (iii) an iteration of steps (i) and (ii) till a reduction in area is achieved. | 2017-06-22 |
20170177751 | SYSTEMS AND METHODS FOR SOLVING COMPUTATIONAL PROBLEMS - Solving computational problems may include generating a logic circuit representation of the computational problem, encoding the logic circuit representation as a discrete optimization problem, and solving the discrete optimization problem using a quantum processor. Output(s) of the logic circuit representation may be clamped such that the solving involves effectively executing the logic circuit representation in reverse to determine input(s) that corresponds to the clamped output(s). The representation may be of a Boolean logic circuit. The discrete optimization problem may be composed of a set of miniature optimization problems, where each miniature optimization problem encodes a respective logic gate from the logic circuit representation. A quantum processor may include multiple sets of qubits, each set coupled to respective annealing signal lines such that dynamic evolution of each set of qubits is controlled independently from the dynamic evolutions of the other sets of qubits. | 2017-06-22 |
20170177752 | 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. | 2017-06-22 |
20170177753 | DEADLOCK DETECTION IN HARDWARE DESIGN USING ASSERTION BASED VERIFICATION - Methods and systems for detecting deadlock in a hardware design. The method comprises identifying one or more control signals in the hardware design; generating a state machine for each of the one or more control signals to track the state of the control signal; generating one or more assertions for each control signal to detect that the control signal is in a deadlock state from the state machine; and detecting whether any of the one or more control signal are in a deadlock state using the assertions. The method may also comprise generating one or more fairness constraints to impose on a particular assertion and detecting the particular control signal is in the deadlock state using the assertions under the fairness constraints. | 2017-06-22 |
20170177754 | METHODS AND APPARATUS FOR USING ANALYTICAL/STATISTICAL MODELING FOR CONTINUED PROCESS VERIFICATION (CPV) - Methods and apparatus are disclosed to provide for using analytical/statistical modeling for continued process verification (CPV). Example disclosed methods include determining distribution characteristics for a plurality of parameters based on a first historical batch dataset measured while manufacturing a first batch at a first time, and generating a model batch based on the distribution characteristics of the plurality of parameters. Example methods also include generating a first set of simulated batch datasets corresponding to a first set of simulated batches by, for each one of the first set of simulated batches: generating values for the plurality of parameters based on the model batch, and determining a quality prediction based on the generated values. The example disclosed methods also include generating a model based on the first set of simulated batch datasets and the first historical batch dataset. The model to be implemented to monitor a subsequent manufacture of a second batch. | 2017-06-22 |
20170177755 | SYSTEM AND METHOD FOR DYNAMICALLY ADJUSTING AN EMERGENCY COORDINATION SIMULATION SYSTEM - A method of dynamically adjusting an emergency coordination simulation system includes performing an emergency coordination simulation for a subarea of a geographic region based on expected user behavior in the subarea and environmental variables of the subarea. An emergency notice is transmitted to a plurality of users. A plurality of citizen sensor reports is received from the users via citizen sensor monitoring devices. The devices communicate with a backend system and form a citizen sensor platform. A consistency check is performed on the plurality of citizen sensor reports. The plurality of citizen sensor reports is filtered to remove outliers. An emergency coordination resimulation is performed for the subarea based on the expected user behavior in the subarea, the environmental variables of the subarea, and the filtered plurality of citizen sensor reports. An updated emergency notice is transmitted to the plurality of users based on the emergency coordination resimulation. | 2017-06-22 |
20170177756 | APPARATUS AND METHOD FOR SAFETY ANALYSIS EVALUATION WITH DATA-DRIVEN WORKFLOW - An apparatus and method for system safety analysis evaluation is provided, the apparatus including processing circuitry configured for generating a calculation matrix for a system, generating a plurality of models based on the calculation matrix, performing a benchmarking or convolution analysis of the plurality of models, identifying a design envelope based on the benchmarking or convolution analysis, deriving uncertainty models from the benchmarking or convolution analysis, deriving an assessment judgment based on the uncertainty models and acceptance criteria, defining one or more limiting scenarios based on the design envelope, and determining a safety margin in at least one figure-of-merit for the system based on the design envelope and the acceptance criteria. | 2017-06-22 |
20170177757 | System and Method for Providing Interactive Wiring Diagram - A method for providing an interactive wiring diagram is provided. The method includes receiving, at a processor of a wireless device, from an image sensor of the wireless device, an image of a wire loom between a first vehicle component and a second vehicle component of a vehicle, the wire loom including a plurality of wire connections of the vehicle. The method includes determining, using a position sensor of the wireless device, a position of the wire loom relative to the vehicle and to the wireless device. The method includes identifying, using a database, a wire connection based upon at least the image or the position of the wire loom. The method includes generating an interactive wiring diagram of the wire connection based upon the identifying. The interactive wiring diagram includes a trace route indicating a presence of a third vehicle component between the first and the second vehicle component. | 2017-06-22 |
20170177758 | METHOD FOR PREDICTING SLAGGING PRODUCTION POSITION AND SLAGGING PRODUCTION POSSIBILITY IN FURNACE - The present disclosure relates to a method for predicting a slagging production position and a slagging production possibility in a furnace, the method including: the analyzing step of analyzing physical compositions of two or more kinds of coal; the phase diagram producing step of producing a phase diagram on the basis of the physical components of the two or more kinds of coal analyzed in the analyzing step; the deriving step of simulating the situation generated when the two or more kinds of coal are co-fired on the basis of the produced phase diagram; and the characteristic analyzing step of analyzing the characteristics in the furnace in the co-firing process of the two or more kinds of coal. | 2017-06-22 |
20170177759 | METHOD AND APPARATUS FOR MODELING MOVEMENT OF TARGET OBJECT BY INTERACTION WITH FLUID - Provided is a method and apparatus for modeling a movement of an object that generates a velocity field in a fluid based on a flow of the fluid, selects a vortex model corresponding to the object in the fluid, updates the velocity field based on a velocity variance of the velocity field obtained using the vortex model, and models a movement of the object based on the updated velocity field. | 2017-06-22 |
20170177760 | OPTICAL METROLOGY OF LITHOGRAPHIC PROCESSES USING ASYMMETRIC SUB-RESOLUTION FEATURES TO ENHANCE MEASUREMENT - A process of calibrating a model, the process including: obtaining training data including: scattered radiation information from a plurality of structures, individual portions of the scattered radiation information being associated with respective process conditions being characteristics of a patterning process of the individual structures; and calibrating a model with the training data by determining a ratio relating a change in one of the process characteristics to a corresponding change in scattered radiation information. | 2017-06-22 |
20170177761 | INTEGRATED MODELING AND SIMULATION OF FORMATION AND WELL PERFORMANCE - A method of performing aspects of an energy industry operation includes receiving input data at a processing system, the input data describing an assembly for performing the energy industry operation and properties of the formation, the assembly including a downhole component, the processing system configured to estimate production properties based on mathematical models including at least a model of the downhole component and one or more models for simulating fluid flow in the formation. The method also includes, based on the input data, generating a workflow that includes steps for estimating production properties using the models, receiving a selection from a user specifying a type of analysis to be performed and/or a level of complexity of analysis to be performed, customizing the workflow based on the user selection, estimating the production properties based on the models, where estimating is performed according to a procedure specified by the workflow. | 2017-06-22 |
20170177762 | DATA CENTER THREE DIMENSION TEMPERATURE AND HUMIDITY CONTOUR GENERATOR AND METHOD - Disclosed is an internet browser based data center 3D dynamic temperature and humidity contour generator. The generator will collect real time rack temperature and humidity sensor data, convert the measured data to be 3D temperature and humidity data through inverse weight coefficient interception, then display these data along the rack's surface in internet browsers to inform data center operator. | 2017-06-22 |
20170177763 | METHOD AND APPARATUS FOR X-RAY IONIZING RADIATION CONTROL - The present invention pertains to a method and apparatus for x-ray ionizing radiation control and ionizing radiation control. A digital representation of an inanimate object is formed. The amount of the radiation at a surface of the inanimate object is simulated. The radiation-matter interaction for a material of the inanimate object is calculated. The amount of energy deposited at a plurality of locations at the inanimate object is calculated. The digital representation of the inanimate object is modified in response to an input from a user and the modified digital representation of the inanimate object is displayed. | 2017-06-22 |
20170177764 | METHOD FOR EXPLOITATION OF HYDROCARBONS FROM A SEDIMENTARY BASIN BY MEANS OF A BASIN SIMULATION TAKING ACCOUNT OF GEOMECHANICAL EFFECTS - Method for exploitation of a sedimentary basin containing hydrocarbons by means of a basin simulation. | 2017-06-22 |