Patent application number | Description | Published |
20110082828 | Large Scale Probabilistic Ontology Reasoning - Techniques for computing a solution to a query formulated against a knowledge base (KB) are provided. The techniques include receiving a query formulated against a knowledge base, wherein the knowledge base comprises a set of one or more axioms, wherein each axiom is annotated with a specific probability value indicating a degree of certainty assigned thereto, ignoring each probability value of the one or more axioms and computing a solution to the query, computing each of one or more justifications for the query solution, wherein computing each of one or more justifications for the query solution comprises determining a minimal set of one or more axioms in the knowledge base that entail the query solution, and using each probability value of the one or more axioms in each justification to compute a net probability of an inferred query solution. | 04-07-2011 |
20110225167 | METHOD AND SYSTEM TO STORE RDF DATA IN A RELATIONAL STORE - A method (and structure) of storing schema-less data of a dataset in a relational database, includes constructing a hash table for the schema-less data, using a processor on a computer. Data in the dataset is stored in a tuple format including a subject along with at least one other entity associated to the subject. Each row of the hashtable will be dedicated to a subject of the dataset, and at least one of the at least one other entity associated with the subject in the row is to be stored in a pair-wise manner in that row of the hashtable. In an exemplary embodiment, RDF data that uses triples (subject, predicate, object) is stored with the predicate/object stored in the pair-wise manner in its associated subject row. | 09-15-2011 |
20110282652 | MAPPING OF RELATIONSHIP ENTITIES BETWEEN ONTOLOGIES - Methods, apparatus and systems, including computer program products, for reducing an error rate when mapping entities between a first ontology and a second ontology. One or more of a general language dictionary and an industry-specific dictionary are provided. Natural language processing of the first ontology is performed to identify one or more candidate relationship entities in the first ontology. Each candidate relationship entity includes a compound name having two or more semantic labels, and each candidate relationship entity has a name that neither exists in the general language dictionary or the industry-specific dictionary. Each of the one or more candidate relationship entities in the first ontology is mapped to one or more entities in the second ontology using one or more configurable computer-implemented mapping algorithms. | 11-17-2011 |
20120036110 | Automatically Reviewing Information Mappings Across Different Information Models - A computer-implemented method, system, and program product for automatically reviewing a mapping between information models. The method includes: receiving a mapping between an element in the first information model to an element in the second information model. Each element is associated with an element identifier and an element value, and the mapping signifies a relationship between the element in the first information model and the element in the second information model. The method further includes comparing the received mapping against one or more known indications of suspicious mappings to determine if the received mapping resembles one of the indications of suspicious mappings. If the received mapping is determined to be suspicious, identifying the received mapping as one that requires review. | 02-09-2012 |
20120109859 | Scalable Ontology Extraction - Techniques for facilitating learning of one or more ontological rules of a resource description framework database are provided. The techniques include obtaining ontology vocabulary from a resource description framework database, generating a rule hypothesis by incrementally building upon a previously learnt rule from the database by adding one or more predicates to the previously learnt rule, performing a constraint check on the generated rule hypothesis by determining compatibility with each previously learnt rule to ensure that a complete rule set including each previously learnt rule and the generated rule hypothesis is consistent, validating the rule hypothesis as a rule using one or more association rule mining techniques to determine validity of the rule hypothesis against the database, and applying the rule to the database to infer one or more facts from the database to facilitate learning of one or more additional ontological rules. | 05-03-2012 |
20120197884 | CREATING BENCHMARK GRAPH DATA - According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset. | 08-02-2012 |
20120246154 | AGGREGATING SEARCH RESULTS BASED ON ASSOCIATING DATA INSTANCES WITH KNOWLEDGE BASE ENTITIES - Methods and systems for aggregating search query results include receiving search query results and schema information for the query results from multiple heterogeneous sources, determining types for elements of the query results based on the schema information, determining potential aggregations for the query results based on the types, which are based on accumulated information from the plurality of heterogeneous resources, and aggregating the query results according to one or more of the potential aggregations. | 09-27-2012 |
20120246175 | ANNOTATING SCHEMA ELEMENTS BASED ON ASSOCIATING DATA INSTANCES WITH KNOWLEDGE BASE ENTITIES - Methods and systems for determining schema element types are shown that include pooling potential annotations for an element of an unlabeled schema from a plurality of heterogeneous sources, scoring the pool of potential annotations according to relevancy using information using instance information from the plurality of heterogeneous sources to produce a relevancy score, and annotating the element of the unlabeled schema using the most relevant potential annotations. | 09-27-2012 |
20130006984 | CREATING BENCHMARK GRAPH DATA - According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset. | 01-03-2013 |
20130024406 | Scalable Ontology Extraction - Techniques for facilitating learning of one or more ontological rules of a resource description framework database are provided. The techniques include obtaining ontology vocabulary from a resource description framework database, generating a rule hypothesis by incrementally building upon a previously learnt rule from the database by adding one or more predicates to the previously learnt rule, performing a constraint check on the generated rule hypothesis by determining compatibility with each previously learnt rule to ensure that a complete rule set including each previously learnt rule and the generated rule hypothesis is consistent, validating the rule hypothesis as a rule using one or more association rule mining techniques to determine validity of the rule hypothesis against the database, and applying the rule to the database to infer one or more facts from the database to facilitate learning of one or more additional ontological rules. | 01-24-2013 |
20130282765 | OPTIMIZING SPARSE SCHEMA-LESS DATA IN RELATIONAL STORES - Various embodiments of the invention relate to optimizing storage of schema-less data. A schema-less dataset including a plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A graph coloring operation is performed on the graph. The graph coloring operation includes assigning each of nodes to a color, where nodes connected by an edge are assigned different colors. A schema is generated that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph based on the color assigned to the node. | 10-24-2013 |
20130332466 | Linking Data Elements Based on Similarity Data Values and Semantic Annotations - Data elements from data sources and having a data value set are linked by using hash functions to determine a dimensionally reduced instance signature for each data element based on all data values associated with that data element to yield a plurality of dimensionally reduced instance signatures of equivalent fixed size such that similarities among the data values in the data value sets across all data elements is maintained among the plurality of instance signatures. Candidate pairs of data elements to link are identified using the plurality of instance signatures in locality sensitive hash functions, and a similarity index is generated for each candidate pair using a pre-determined measure of similarity. Candidate pairs of data elements having a similarity index above a given threshold are linked. | 12-12-2013 |
20130332467 | Linking Data Elements Based on Similarity Data Values and Semantic Annotations - Data elements from data sources and having a data value set are linked by using hash functions to determine a dimensionally reduced instance signature for each data element based on all data values associated with that data element to yield a plurality of dimensionally reduced instance signatures of equivalent fixed size such that similarities among the data values in the data value sets across all data elements is maintained among the plurality of instance signatures. Candidate pairs of data elements to link are identified using the plurality of instance signatures in locality sensitive hash functions, and a similarity index is generated for each candidate pair using a pre-determined measure of similarity. Candidate pairs of data elements having a similarity index above a given threshold are linked. | 12-12-2013 |
20130332478 | QUERYING AND INTEGRATING STRUCTURED AND INSTRUCTURED DATA - A computer-implemented method, system, and article of manufacture for querying and integrating structured and unstructured data. The method includes: receiving entity information that is extracted from a first set of unstructured data using an open domain information extraction system, wherein the entity information comprises relationship information between a first entity and a second entity of the first set of unstructured data; recognizing a pattern based on the relationship information and creating a schema for the first set of unstructured data based on the pattern; and associating an element of the created schema with (i) an entity of a second set of unstructured data or (ii) a schema element of an existing set of structured data if there is sufficient overall similarity between the created schema element and either the second unstructured data entity or the schema element of the existing structured data. | 12-12-2013 |
20140012884 | OPTIMIZING SPARSE SCHEMA-LESS DATA IN DATA STORES - Various embodiments of the invention relate to optimizing storage of schema-less data. At least one of a schema-less dataset including a plurality of resources one or more query workloads associated with the plurality of resources is received. Each resource is associated with at least a plurality of properties. At least one set of co-occurring properties from the plurality of properties is identified. A graph including a plurality of nodes is generated. Each of the nodes represents a unique property in the set of co-occurring properties. The graph further includes an edge connecting each node representing a pair of co-occurring properties. A schema is generated based on the graph that assigns a column identifier from a table to each unique property represented by one of the nodes in the graph. | 01-09-2014 |
20140074878 | SPREADSHEET SCHEMA EXTRACTION - Aspects of the present invention provide a tool for extracting schema from a spreadsheet. In an embodiment, a set of data that is stored in an uncataloged tabular format, such as a spreadsheet, is retrieved. The structure of the retrieved set of data is surveyed to determine the dataset schema thereof. Then, data elements within the dataset schema are analyzed to obtain information regarding the data elements. Based on dataset schema and the element information, an interface can be constructed that allows remote access to the set of data. | 03-13-2014 |
20140075278 | SPREADSHEET SCHEMA EXTRACTION - Aspects of the present invention provide a tool for extracting schema from a spreadsheet. In an embodiment, a set of data that is stored in an uncataloged tabular format, such as a spreadsheet, is retrieved. The structure of the retrieved set of data is surveyed to determine the dataset schema thereof. Then, data elements within the dataset schema are analyzed to obtain information regarding the data elements. Based on dataset schema and the element information, an interface can be constructed that allows remote access to the set of data. | 03-13-2014 |
20140143280 | Scalable Summarization of Data Graphs - Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently. | 05-22-2014 |
20140143281 | Scalable Summarization of Data Graphs - Keyword searching is used to explore and search large Resource Description Framework datasets having unknown or constantly changing structures. A succinct and effective summarization is built from the underlying resource description framework data. Given a keyword query, the summarization lends significant pruning powers to exploratory keyword searches and leads to much better efficiency compared to previous work. The summarization returns exact results and can be updated incrementally and efficiently. | 05-22-2014 |
20140304251 | Method and Apparatus for Optimizing the Evaluation of Semantic Web Queries - A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database. | 10-09-2014 |
20150052134 | Method and Apparatus for Storing Sparse Graph Data as Multi-Dimensional Cluster - A system for storing graph data as a multi-dimensional cluster having a database with a graph dataset containing data and relationships between data pairs and a schema list of storage methods that use a table with columns and rows associated with data or relationships. An analyzer module to collect statistics of a graph dataset and a dimension identification module to identify a plurality of dimensions that each represent a column in the table. A schema creation and loading module creates a modified storage method and having a plurality of distinct table blocks and a plurality of table block indexes, one index for each table block and arranges the data and relationships in the given graph dataset in accordance with the modified storage method to create the multi-dimensional cluster. | 02-19-2015 |
20150052175 | Method and Apparatus for Identifying the Optimal Schema to Store Graph Data in a Relational Store - A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and. associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods. | 02-19-2015 |
20150149440 | SYSTEMS AND METHODS FOR FINDING OPTIMAL QUERY PLANS - Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query. | 05-28-2015 |
20150193478 | Method and Apparatus for Determining the Schema of a Graph Dataset - A schema for a dataset is identified by identifying a dataset comprising data and relationships between data pairs. An original schema is identified for the dataset. This original schema comprises an organizational structure. An initial fit between the dataset and the original schema is determined. The initial fit quantifying a conformity of the data in the dataset to the organizational structure of the original schema. A plurality of additional schemas are identified. Each additional schema is a distinct organizational schema. The dataset is partitioned into a plurality of subsets. Each subset comprises a modified fit quantifying a modified conformity of subset data in each subset to one of the original schema and the additional schemas. The modified fit is greater than the original fit. | 07-09-2015 |
20150213089 | Method and Apparatus for Optimizing the Evaluation of Semantic Web Queries - A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database. | 07-30-2015 |
Patent application number | Description | Published |
20130066770 | Multi Tenancy For Single Tenancy Applications - A mechanism is provided for deploying software applications in a cloud computing environment. An administrator is provided an interface for allowing a software application that is designed for a single tenant to be used by a plurality of users. An aspect of the invention is to provide a mechanism for quickly and easily giving multi-user qualities to a single tenant application like autoCAD. As such, multiple users can access the application without the need to download and install a version locally on their system. The system is able to determine the period of time for which an application is in use for a given user, because every application is run on a resource that is part of the cloud environment. Therefore, it is possible for the application provider to charge for the application in a usage-based model—e.g. by the hour, or day—without any re-engineering of the existing application. | 03-14-2013 |
20130066945 | Multi Tenant Access To Applications - A mechanism is provided for presenting a software application to a plurality of users in a cloud computing environment. For example, an application that was designed for use by a single user is provided in a cloud based platform without re-architecting the application. Using a web-based interface, multiple cloud users may launch and execute the application. The various instances of the application are provided to the cloud users as if the application were designed as a multi-user application. | 03-14-2013 |
20130067345 | Automated Desktop Services Provisioning - A mechanism is provided for scalably creating and deploying a network of virtual computers with common desktop images in a cloud computing environment. An administrator is provided an interface for defining a user desktop comprising an OS and a set of applications and associated settings. The administrator may further enter the number of roles or remote users. Based on this information the system creates a golden image or master template of the desktop and propagates the image throughout the cloud platform. The underlying provisioning of the virtual machines in the cloud is transparent to the user. The same automated mechanism used for creating the golden image is also used to update the golden image whenever there are updates to the OS or any applications and settings. The system automatically propagates the new image throughout the cloud platform. | 03-14-2013 |
20130074064 | AUTOMATED INFRASTRUCTURE PROVISIONING - A mechanism is provided for creating and deploying a user environments for work groups in a cloud computing environment. A user such as an administrator is provided an interface for defining an end user computing environment and a desired IT infrastructure. Based on this information the system creates the infrastructure in the cloud platform. The underlying provisioning of the infrastructure in the cloud is transparent to the administrator. | 03-21-2013 |
20140082059 | MULTI TENANT ACCESS TO APPLICATIONS - A mechanism is provided for presenting a software application to a plurality of users in a cloud computing environment. For example, an application that was designed for use by a single user is provided in a cloud based platform without re-architecting the application. Using a web-based interface, multiple cloud users may launch and execute the application. The various instances of the application are provided to the cloud users as if the application were designed as a multi-user application. | 03-20-2014 |
20140136403 | MULTI TENANCY FOR SINGLE TENANCY APPLICATIONS - A mechanism is provided for deploying software applications in a cloud computing environment. An administrator is provided an interface for allowing a software application that is designed for a single tenant to be used by a plurality of users. An aspect of the invention is to provide a mechanism for quickly and easily giving multi-user qualities to a single tenant application like autoCAD. As such, multiple users can access the application without the need to download and install a version locally on their system. The system is able to determine the period of time for which an application is in use for a given user, because every application is run on a resource that is part of the cloud environment. Therefore, it is possible for the application provider to charge for the application in a usage-based model—e.g., by the hour, or day—without any re-engineering of the existing application. | 05-15-2014 |
Patent application number | Description | Published |
20090287822 | GROUP BASED ALLOCATION OF NETWORK BANDWIDTH - The present invention extends to methods, systems, and computer program products for group based allocation of terminal server network bandwidth. Output packets are classified into groups based on classification criteria. Output packets for each group are queue into a corresponding queue. During a queue flush cycle each queue containing data is flushed for an essentially equal amount of time. Flushing each queue essentially equally reduces the negative impact that can otherwise result when a subset of sessions (or even a single session) request(s) a disproportional share of terminal server network bandwidth. Responsiveness can be further increased by distributing the essentially equal amount for each queue across the queue flush cycle. | 11-19-2009 |
20100146127 | USER-MODE BASED REMOTE DESKTOP PROTOCOL (RDP) ENCODING ARCHITECTURE - Techniques are disclosed for a user-mode based remote desktop protocol (RDP) encoding architecture. A user mode desktop application and user mode virtual channel application run in user-mode session space. Virtual channel data from the virtual channel application is marshaled and sent to a RDP encoder process in user-mode system space. There it is converted to RDP protocol data units (PDU) and sent to a remote client across a communications network. Graphics data from the desktop application is sent to a display driver in kernel-mode session space and then to a graphics reflector that marshals the graphics data and sends it to the RDP encoder for a similar transformation. | 06-10-2010 |
20110153781 | ROAMING PROFILES AND APPLICATION COMPATIBILITY IN MULTI-USER SYSTEMS - Systems, methods, and computer-readable storage media are disclosed for roaming profiles and application compatibility in multi-user systems. In an embodiment, a user profile exists on a plurality of client computers. Each client computer executes a roaming profile client that intercepts a change to an application's settings. The roaming profile client sends this change to a roaming profile server that stores it. When the user profile logs on to a second client computer, the roaming profile server sends an indication of the change to a second roaming profile client on the second client computer. This roaming profile client alters the settings for the application on the second client computer such that, when the user session executes the application on the second client computer, the application reflects the change. | 06-23-2011 |
20110161957 | Virtualized Eco-Friendly Remote Presentation Session Role - Systems, methods, and computer-readable storage media are disclosed for virtualized eco-friendly remote presentation session roles. In an embodiment, a connection broker monitors the servers of a server farm, and, based upon characteristics of remote presentation sessions served by VMs executing on those servers, directs VMs on those servers to be migrated between servers, changed from sleeping to running or vice versa, or other operations that may improve the performance of the server farm as a whole. | 06-30-2011 |
20110162087 | VIRTUALIZING REMOTE PRESENTATION SESSION CLIENT LICENSING WITH A SERVER-BASED BROKER - Systems, methods, and computer-readable storage media are disclosed for virtualizing remote presentation session licensing issuance for a system executing a plurality of virtual machines hosting a remote presentation session server. In an embodiment, a licensing broker is executed in the host partition of the system, and each session server, upon receiving a request for a license from a client, transmits the request to the broker. The broker completes the license negotiation with a license server responsible for issuing licenses, and once issued, the broker transmits this to the corresponding session server, which completes the licensing transaction with the client. | 06-30-2011 |
20110185068 | MULTI-LINK REMOTE PROTOCOL - In various embodiments, a remote client is allowed to access at least a part of a connection service located on alternate sources other than the primary remote presentation server. In some embodiments, the remote presentation virtual channels may be split into multiple connections with the purpose of allowing better flow control. Some embodiments may be implemented in a virtual machine environment for cases in which the data to be transferred through a data channel is located in the host virtual machine partition but the remote endpoint is located on the guest virtual machine partition. | 07-28-2011 |
20110219287 | REMOTE PRESENTATION OVER LOSSY TRANSPORT WITH FORWARD ERROR CORRECTION - In various embodiments, methods and systems are disclosed for integrating a remote presentation protocol with a datagram based transport. In one embodiment, an integrated protocol is configured to support lossless or reduced loss transport based on Retransmission (ARQ) combined with Forward Error Correction (FEC). The protocol involves encoding and decoding of data packets including feedback headers and FEC packets, continuous measurement of RTT, RTO and packet delay, dynamically evaluating loss probability to determine and adjust the ratio of FEC, congestion management based on dynamically detecting increase in packet delay, and fast data transmission rate ramp-up based on detecting a decrease in packet delay. | 09-08-2011 |
20120117245 | GROUP BASED ALLOCATION OF NETWORK BANDWIDTH - The present invention extends to methods, systems, and computer program products for group based allocation of terminal server network bandwidth. Output packets are classified into groups based on classification criteria. Output packets for each group are queue into a corresponding queue. During a queue flush cycle each queue containing data is flushed for an essentially equal amount of time. Flushing each queue essentially equally reduces the negative impact that can otherwise result when a subset of sessions (or even a single session) request(s) a disproportional share of terminal server network bandwidth. Responsiveness can be further increased by distributing the essentially equal amount for each queue across the queue flush cycle. | 05-10-2012 |
20120317236 | Web-Browser Based Desktop And Application Remoting Solution - An invention is disclosed for conducting a remote presentation session with a client that uses a web browser to conduct the session. In embodiments, a proxy server exists between the remote presentation server and the client. The proxy server establishes a HTTP session with the client and a remote presentation session with the client. The server generates graphics encoded with a remote presentation protocol and sends them to the proxy, which re-encodes them as video and sends them to the client for display in the web browser. The client captures user input at the web browser and sends it to the proxy, which encodes it with the remote presentation protocol and sends it to the server to be processed. | 12-13-2012 |
20130067019 | SELECTIVE USE OF SHARED MEMORY FOR REMOTE DESKTOP APPLICATION - A method includes determining if a server supporting an application and a client having remote desktop access to the server are on a same physical computing device. Upon determining that the server and the client are on the same physical computing device, graphics data related to the application is stored from the server to shared memory that is accessible by the server and by the client. Information to enable the client to retrieve the graphics data stored by the server in the shared memory is communicated from the server to the client. | 03-14-2013 |
20140055464 | HARDWARE ACCELERATION FOR REMOTE DESKTOP PROTOCOL - A method for offloading remote terminal services processing tasks to a peripheral device that would otherwise be performed in a computer system's processor and memory. In one embodiment, the disclosed method is utilized in a layered network model, wherein computing tasks that are typically performed in network applications are instead offloaded to a peripheral such as a network interface card (NIC). | 02-27-2014 |
20140379793 | SELECTIVE USE OF SHARED MEMORY FOR REMOTE DESKTOP APPLICATION - A method includes determining if a server supporting an application and a client having remote desktop access to the server are on a same physical computing device. Upon determining that the server and the client are on the same physical computing device, graphics data related to the application is stored from the server to shared memory that is accessible by the server and by the client. Information to enable the client to retrieve the graphics data stored by the server in the shared memory is communicated from the server to the client. | 12-25-2014 |
20150249723 | ROAMING PROFILES AND APPLICATION COMPATIBILITY IN MULTI-USER SYSTEMS - Systems, methods, and computer-readable storage media are disclosed for roaming profiles and application compatibility in multi-user systems. In an embodiment, a user profile exists on a plurality of client computers. Each client computer executes a roaming profile client that intercepts a change to an application's settings. The roaming profile client sends this change to a roaming profile server that stores it. When the user profile logs on to a second client computer, the roaming profile server sends an indication of the change to a second roaming profile client on the second client computer. This roaming profile client alters the settings for the application on the second client computer such that, when the user session executes the application on the second client computer, the application reflects the change. | 09-03-2015 |
Patent application number | Description | Published |
20110286032 | SYSTEM AND METHOD FOR IDENTIFYING A CAUSE OF LATENESS OF A PRINT JOB IN A PRINT PRODUCTION ENVIRONMENT - A system for determining a cause of lateness of a print job may include a computing device and a computer-readable storage medium in communication with the computing device. The computer-readable storage medium may include one or more programming instructions for identifying a late print job, identifying a plurality of document production stations that processed at least a portion of the late print job, determining an associated contribution value representing a contribution of the document production station to the lateness, determining sources of the lateness, displaying a first visual depiction that visually depicts a measure of a contribution of each of the identified document production stations to a collective lateness of the print shop, receiving a user selection of one of the document production stations and a time period, and displaying a second visual depiction of one or more print jobs processed by the document production station during the time period. | 11-24-2011 |
20120282587 | SYSTEM AND METHOD FOR GENERATING AND IMPLEMENTING INDIVIDUALIZED EDUCATIONAL PRACTICE WORKSHEETS - A method and system generates and administers an individualized student worksheet. A set of problems and a unique embedded data pattern are generated and printed on a worksheet substrate. A teacher may point a camera pen point at an area of the pattern to identify the substrate and a location on the substrate. Based on this information, the method and system may access a worksheet file to identify the problem whose physical position corresponds to the captured embedded data. The system may present the problem's solution to the teacher, who may then use the pen to mark the problem as correct or incorrect, and optionally annotate notes for the student, teacher or others. The camera pen may collect the teacher's marks and annotations and store them with the worksheet file for later retrieval. | 11-08-2012 |
20120288841 | METHODS AND SYSTEMS FOR CLUSTERING STUDENTS BASED ON THEIR PERFORMANCE - Methods and systems of clustering a plurality of students are disclosed. A computing device may receive assessment data for each of a plurality of students. The assessment data includes information pertaining to each of a plurality of questions in an assessment. The computing device may also receive a number of clusters into which to organize the plurality of students. The computing device may determine a similarity value between each pair of students in the plurality of students based on the assessment data associated with each student. The computing device may organize the plurality of students into the number of clusters based on the similarity values. | 11-15-2012 |
20120303406 | SYSTEM AND METHOD FOR THE DYNAMIC ALLOCATION OF RESOURCES - A system and method for dynamically allocating resources in a process. A demand pattern change detection unit, a future demand forecasting unit and a process optimization engine can be employed to constantly adjust resource allocation and assist in maintaining processes in a state of peak performance. An initial resource allocation unit generates an initial resource allocation plan based on past experience with respect to the process. The change detection unit detects a shift in the job demand pattern utilizing a statistical data when a change occurs in process requirements. The future demand generation unit accurately generates future demand data based on current job data and the outlook of future demand. The optimization engine acts as a surrogate process expert and provides recommendations to the process owner regarding potential possible resource allocation policies for new job demand data utilizing a simulation process to predict the result of variable staffing configurations. | 11-29-2012 |
20130028574 | SYSTEMS AND METHODS FOR ENRICHING AUDIO/VIDEO RECORDINGS - Systems and methods are presented for enriching audio/video recordings using annotation data provided by attendees of a presentation, in which annotations from attendees are received by a server which merges and synchronizes the annotation data, performs text data mining to identify key messages and temporal segments of the audio/video data, and constructs an enriched audio/video recording including audio and/or video data as well as segment data and key message data for ease of user navigation. | 01-31-2013 |
20130052628 | SYSTEM FOR CO-CLUSTERING OF STUDENT ASSESSMENT DATA - A system and method for making use of formative assessment data collected is disclosed that identifies clusters of students and concurrently determines the characteristics of the student clusters. A decomposition of the data is performed with spectral theories of graphs and fuzzy logic algorithms to identify the clusters of students, clusters of assessment data and relationships between them. An actionable output is presented to teachers for the evaluation of educational progress. | 02-28-2013 |
20130063764 | METHOD AND SYSTEM FOR PERFORMING STATISTICAL THROUGHPUT CONTROL IN A PRINT SHOP - A method of determining a probability of a set of print jobs being completed within a time period may include receiving a schedule associated with a set of print jobs. The schedule may include a sequence in which the set of print jobs is to be processed, a mean processing time associated with each print job in the set, and a standard deviation of a processing time associated with each print job in the set. The method may include determining a probability that a print shop will complete processing of the set of print jobs within a time period based on the mean processing time and standard deviation associated with each of the print jobs in the set that has not been processed and displaying the probability on a display device. | 03-14-2013 |
20130070285 | METHOD AND SYSTEMS FOR BALANCING MACHINE LOAD - Methods and systems of balancing job assignments to a plurality of machines are disclosed. A computing device receives multiple jobs each having a job size and determines a job order for the jobs based on each job's job size. A machine order is determined for a plurality of machines based on a setup time and a processing rate associated with each machine. The computing device assigns one or more jobs to each machine based on the job order and the machine order such that a maximum total processing time for the machines is minimized. A total processing time for each machine is determined based on the number of jobs and the cumulative job size of the jobs assigned to the machine, and the setup time and the processing time associated with the machine. The maximum total processing time is the largest of the total processing times for the machines. | 03-21-2013 |
20130070286 | METHODS AND SYSTEMS FOR LOAD LEVELING IN A PRINT SHOP - A method and system for managing print shop workflow determines whether variations in print shop workflow may be reduced by shifting one or more customers' scheduled orders to different time periods. By shifting an order from one time period to another, the system may reduce variability in demand levels over time, thus helping increase overall system efficiency. To do this, one or more customers are selected as candidates for print shop order rescheduling. The system identifies customer orders that, if moved to other time periods, will most reduce demand level variations. A user may accept the system's recommendations, or the system may present a user with several alternative load leveling options for selection. The system may then cause the orders to be printed based on the load leveling proposal and the user's selection. | 03-21-2013 |
20130195381 | SYSTEM AND METHOD FOR CAPTURING PRODUCTION WORKFLOW INFORMATION - A workflow information capture system uses a digital pen to capture handwritten information about a production process resource. The pen captures the handwritten markings from a worksheet, identifies the position of the marking, based on the position determines one or more process parameters for the marking, and saves the handwritten markings and their corresponding process parameter in a memory. The system may then use this information to generate recommendations for improving a workflow that is implemented by the process resource. | 08-01-2013 |
20140176512 | SYSTEM AND METHOD FOR CREATING AND MODIFYING PHYSICALLY TRANSIENT HANDWRITTEN DIGITAL DOCUMENTS - A method, system, and apparatus for capturing information is disclosed. The method includes emitting energy of a first wavelength from a first energy source located proximate to a first end of a digital pen and forming a first set handwritten markings on the substrate by causing the substrate to image as a result of an exposure of the substrate to the energy emitted from the first energy source. The method also includes detecting by an image-capturing sensor of the digital pen a first detected portion of a position-identifying pattern on the substrate and storing in the memory a digital document file comprising the first set of handwritten markings and the first detected portion of the position-identifying data. An apparatus and system for performing the method is also disclosed. | 06-26-2014 |
20140234822 | SYSTEM FOR CO-CLUSTERING OF STUDENT ASSESSMENT DATA - A system and method for making use of formative assessment data collected is disclosed that identifies clusters of students and concurrently determines the characteristics of the student clusters. A decomposition of the data is performed with spectral theories of graphs and fuzzy logic algorithms to identify the clusters of students, clusters of assessment data and relationships between them. An actionable output is presented to teachers for the evaluation of educational progress. | 08-21-2014 |
Patent application number | Description | Published |
20080244544 | Using hardware checkpoints to support software based speculation - Hardware checkpoints may be used to mark software-based speculation regions. An instruction may be provided at the beginning of a speculation region and at the end of the speculation region. If an exception occurs during the speculation region, a hardware rollback may be occurred. The hardware rollback rolls back to the instruction at the beginning of the speculation region. The hardware may take a checkpoint by taking a register snapshot and treating future memory updates as tentative. When the instruction marking the end of the speculation is reached, all the tentative memory updates are committed and the previously taken register snapshot is discarded. | 10-02-2008 |
20090006755 | Providing application-level information for use in cache management - In one embodiment, the present invention includes a method for associating a first identifier with data stored by a first agent in a cache line of a cache to indicate the identity of the first agent, and storing the first identifier with the data in the cache line and updating at least one of a plurality of counters associated with the first agent in a metadata storage in the cache, where the counter includes information regarding inter-agent interaction with respect to the cache line. Other embodiments are described and claimed. | 01-01-2009 |
20110153307 | Transitioning From Source Instruction Set Architecture (ISA) Code To Translated Code In A Partial Emulation Environment - In one embodiment, a processor can operate in multiple modes, including a direct execution mode and an emulation execution mode. More specifically, the processor may operate in a partial emulation model in which source instruction set architecture (ISA) instructions are directly handled in the direct execution mode and translated code generated by an emulation engine is handled in the emulation execution mode. Embodiments may also provide for efficient transitions between the modes using information that can be stored in one or more storages of the processor and elsewhere in a system. Other embodiments are described and claimed. | 06-23-2011 |
20110153992 | METHODS AND APPARATUS TO MANAGE OBJECT LOCKS - Example methods and apparatus to manage object locks are disclosed. A disclosed example method includes receiving an object lock request from a processor, the lock request associated with object lock code to lock an object, and generating object lock-bypass code based on a type of the processor, the object lock-bypass code to execute in a managed runtime in response to receiving the object lock request. The example method also includes identifying a type of instruction set architecture (ISA) associated with the processor, invoking a checkpoint instruction for the processor based on the identified ISA, suspending the object lock code from executing and executing target code when the object is uncontended, and allowing the object lock code to execute when the object is contended. | 06-23-2011 |
20110167416 | SYSTEMS, APPARATUSES, AND METHODS FOR A HARDWARE AND SOFTWARE SYSTEM TO AUTOMATICALLY DECOMPOSE A PROGRAM TO MULTIPLE PARALLEL THREADS - Systems, apparatuses, and methods for a hardware and software system to automatically decompose a program into multiple parallel threads are described. In some embodiments, the systems and apparatuses execute a method of original code decomposition and/or generated thread execution. | 07-07-2011 |
20110264866 | TECHNIQUE FOR USING MEMORY ATTRIBUTES - A technique for using memory attributes to relay information to a program or other agent. More particularly, embodiments of the invention relate to using memory attribute bits to check various memory properties in an efficient manner. | 10-27-2011 |
20130166886 | SYSTEMS, APPARATUSES, AND METHODS FOR A HARDWARE AND SOFTWARE SYSTEM TO AUTOMATICALLY DECOMPOSE A PROGRAM TO MULTIPLE PARALLEL THREADS - Systems, apparatuses, and methods for a hardware and software system to automatically decompose a program into multiple parallel threads are described. For example, a method according to one embodiment comprises: analyzing a single-threaded region of executing program code, the analysis including identifying dependencies within the single-threaded region; determining portions of the single-threaded region of executing program code which may be executed in parallel based on the analysis; assigning the portions to two or more parallel execution tracks; and executing the portions in parallel across the assigned execution tracks. | 06-27-2013 |
20130198458 | TRANSITIONING FROM SOURCE INSTRUCTION SET ARCHITECTURE (ISA) CODE TO TRANSLATED CODE IN A PARTIAL EMULATION ENVIRONMENT - In one embodiment, a processor can operate in multiple modes, including a direct execution mode and an emulation execution mode. More specifically, the processor may operate in a partial emulation model in which source instruction set architecture (ISA) instructions are directly handled in the direct execution mode and translated code generated by an emulation engine is handled in the emulation execution mode. Embodiments may also provide for efficient transitions between the modes using information that can be stored in one or more storages of the processor and elsewhere in a system. Other embodiments are described and claimed. | 08-01-2013 |
20130262779 | PROFILE-BASED HARDWARE PREFETCHING - Profiling and analyzing modules may be combined with hardware modules to identify a likelihood that a particular region of code in a computer program contains data that would benefit from prefetching. Those regions of code that would not benefit from prefetching may also be identified. Once a region of code has been identified, a hardware prefetcher may be selectively enabled or disable when executing code in identified code region. In some instances, once a processing device finishes executing code in the identified code region, the state of the hardware prefetcher may then be switched back to its original state. Systems, methods, and media are provided. | 10-03-2013 |
20130283249 | INSTRUCTION AND LOGIC TO PERFORM DYNAMIC BINARY TRANSLATION - A micro-architecture may provide a hardware and software co-designed dynamic binary translation. The micro-architecture may invoke a method to perform a dynamic binary translation. The method may comprise executing original software code compiled targeting a first instruction set, using processor hardware to detect a hot spot in the software code and passing control to a binary translation translator, determining a hot spot region for translation, generating the translated code using a second instruction set, placing the translated code in a translation cache, executing the translated code from the translated cache, and transitioning back to the original software code after the translated code finishes execution. | 10-24-2013 |
20130311758 | HARDWARE PROFILING MECHANISM TO ENABLE PAGE LEVEL AUTOMATIC BINARY TRANSLATION - A hardware profiling mechanism implemented by performance monitoring hardware enables page level automatic binary translation. The hardware during runtime identifies a code page in memory containing potentially optimizable instructions. The hardware requests allocation of a new page in memory associated with the code page, where the new page contains a collection of counters and each of the counters corresponds to one of the instructions in the code page. When the hardware detects a branch instruction having a branch target within the code page, it increments one of the counters that has the same position in the new page as the branch target in the code page. The execution of the code page is repeated and the counters are incremented when branch targets fall within the code page. The hardware then provides the counter values in the new page to a binary translator for binary translation. | 11-21-2013 |
20140025901 | TECHNIQUE FOR USING MEMORY ATTRIBUTES - A technique for using memory attributes to relay information to a program or other agent. More particularly, embodiments of the invention relate to using memory attribute bits to check various memory properties in an efficient manner. | 01-23-2014 |
20140258677 | ANALYZING POTENTIAL BENEFITS OF VECTORIZATION - Embodiments of computer-implemented methods, systems, computing devices, and computer-readable media (transitory and non-transitory) are described herein for analyzing execution of a plurality of executable instructions and, based on the analysis, providing an indication of a benefit to be obtained by vectorization of at least a subset of the plurality of executable instructions. In various embodiments, the analysis may include identification of the subset of the plurality of executable instructions suitable for conversion to one or more single-instruction multiple-data (“SIMD”) instructions. | 09-11-2014 |
20150277867 | INTER-ARCHITECTURE COMPATABILITY MODULE TO ALLOW CODE MODULE OF ONE ARCHITECTURE TO USE LIBRARY MODULE OF ANOTHER ARCHITECTURE - An inter-architecture compatibility apparatus of an aspect includes a control flow transfer reception module to receive a first call procedure operation, intended for a first architecture library module, from a first architecture code module. The first call procedure operation involves a first plurality of input parameters. An application binary interface (ABI) change module is coupled with the control flow transfer reception module. The ABI change module makes ABI changes to convert the first call procedure operation involving the first plurality of input parameters to a corresponding second call procedure operation involving a second plurality of input parameters. The second call procedure operation is compatible with a second architecture library module. A control flow transfer output module is coupled with the ABI change module. The control flow transfer output module provides the second call procedure operation to the second architecture library module. | 10-01-2015 |