Patent application number | Description | Published |
20100064225 | Network Map - The claimed method and system provides a graphical user interface that illustrates network topology information, including connection paths between devices on the local network and an external network such as the Internet. The claimed method and system may use a three column format for presenting the topology that is more intuitive for a user. Also, the claimed method and system may aggregate context and connection information from multiple different protocols to provide the topology display. Further, the claimed method and system may use a device registry to enable customized and extensible representations of the network devices. | 03-11-2010 |
20100077394 | COALESCING PERIODIC TIMER EXPIRATION IN GUEST OPERATING SYSTEMS IN A VIRTUALIZED ENVIRONMENT - Techniques are disclosed for coalescing timer ticks generated by timers used to service guest operating systems executing in virtual machines. By coalescing timer ticks a logical processor can enter a low power mode thereby reducing power consumed by the system. | 03-25-2010 |
20100218183 | POWER-SAVING OPERATING SYSTEM FOR VIRTUAL ENVIRONMENT - Principles for enabling power management techniques for virtual machines. In a virtual machine environment, a physical computer system may maintain management facilities to direct and control one or more virtual machines executing thereon. In some techniques described herein, the management facilities may be adapted to place a virtual processor in an idle state in response to commands from a guest operating system. One or more signaling mechanisms may be supported such that the guest operating system will command the management facilities to place virtual processors in the idle state. | 08-26-2010 |
20120060072 | ERASURE CODING IMMUTABLE DATA - Embodiments of the present invention relate to systems, methods and computer storage media for erasure coding data in a distributed computing environment. A sealed extent is identified that is comprised of two or more data blocks and two or more index blocks. The sealed extent is optimized for erasure coding by grouping the two or more data blocks within the optimized sealed extent together and grouping the two or more index blocks within the optimized sealed extent together. The optimized extent may also be erasure coded, which includes creating data fragments and coding fragments. The data fragments and the coding fragments may also be stored in the distributed computing environment. Additional embodiments include monitoring statistical information to determine if replication, erasure coding or a hybrid storage plan should be utilized. | 03-08-2012 |
Patent application number | Description | Published |
20090299862 | ONLINE AD SERVING - Online ad hosting (e.g., hosting ads from one domain on a webpage from a different domain) is accomplished using a cross-domain frame (e.g., an inline frame (IFrame)), a secure inter-frame communications channel, and a source code interface (e.g., a set of application program interfaces (APIs)). That is, a cross-domain IFrame may be created in a host webpage, which can isolate an ad from the host webpage. An inter-frame communications channel may be utilized to communicate between the contents of the cross-domain frame and the host webpage. Further, a source code interface may be used to communicate a host's preferences for an ad's parameters and restrictions. | 12-03-2009 |
20090300496 | USER INTERFACE FOR ONLINE ADS - A user interface may be utilized to allow a user to control display properties of online ad content on a hosting webpage (e.g., hosting ads from one domain on a webpage from a different domain). This may be accomplished by creating a cross-domain frame in the hosting webpage, which can contain the ad content. An instantiation of a user interface may be created on the hosting webpage that has an ability to control display properties of the cross-domain frame, thereby controlling display properties of the ad content in the cross-domain frame. Further, a task manager may be utilized as part of the user interface to facilitate a host of the hosting webpage to manage ad content. | 12-03-2009 |
20090327869 | ONLINE AD SERVING - Online ad hosting (e.g., hosting ads from one domain on a webpage from a different domain) is accomplished using an insulator cross-domain frame (e.g., an inline frame (IFrame)), into which a third party may load content, source code to detect events associated with the third party content (e.g., detecting if ad content wishes to expand), and a communicator same-domain IFrame for sending requests to the host webpage associated with detected events. That is, a cross-domain IFrame may be created in a host webpage, which can isolate an ad from the host webpage. A communicator frame may be utilized to communicate text messages between the contents of the cross-domain frame and the host webpage. Further, an API can be used to apply parameters, restrictions and allowable events to the third party content in the insulator IFrame. | 12-31-2009 |
20130117840 | USER-DRIVEN ACCESS CONTROL - An access system is described herein which allows an application module to access a user-owned resource based on an indication of a user's intent to interact with the user-owned resource. For example, the application module can provide an application user interface which embeds a gadget associated with a particular user-owned resource. The access system can interpret the user's interaction with the gadget as conferring implicit permission to the application module to access the user-owned resource associated with the gadget. In addition, or alternatively, the user may make a telltale gesture in the course of interacting with the application module. The access system can interpret this gesture as conferring implicit permission to the application module to access a user-owned resource that is associated with the gesture. | 05-09-2013 |
20130205385 | PROVIDING INTENT-BASED ACCESS TO USER-OWNED RESOURCES - An access system is described herein which allows an application to access a system-level and/or application-specific user-owned resource based on a user's interaction with an intent-based access mechanism. For example, the intent-based access mechanism may correspond to a gadget that is embedded in an application user interface provided by the application, and/or logic for detecting a permission-granting input sequence. The access system accommodates different types of intent-based access mechanisms. One type is a scheduled intent-based access mechanism. Another type provides access to two or more user-owned resources. Further, the access system includes a mechanism for determining whether the application is permitted to use an intent-based access mechanism. | 08-08-2013 |
Patent application number | Description | Published |
20100281537 | SECURE MULTI-PRINCIPAL WEB BROWSER - A web browser operating system using a browser kernel places principals having different origins in separate principal instances, where each separate principal instance executes in a separate protection domain. Principal origin may be determined using the combination of protocol, domain name, and port. The browser kernel mediates communications between principal instances, and between the principal instances and the operating system. Within each principal instance, a browser runtime executes as a restricted operating system process (ROSP), while any plugins are executed as a separate ROSP. Renderings from each browser runtime are combined by the browser kernel for presentation to a user. | 11-04-2010 |
20110055395 | RESOURCE SHARING IN MULTI-PRINCIPAL BROWSER - Techniques for providing resource sharing in a multi-principal browser are described. Resource sharing includes managing a resource for web entity by determining how to divide the resource to share among two or more web entities based at least in part on a Document Object Model (DOM)-recursive resource allocation policy or an application-specified resource allocation policy. A web entity includes a principal instance contending for the resource. The process identifies resource allocation mechanisms from each resource type based at least in part on the DOM-recursive sharing policy or the application-specified resource allocation policy along with the resource type. | 03-03-2011 |
20110055892 | ACCESS CONTROL IN A MULTI-PRINCIPAL BROWSER - A principal operating system based-browser controls access to resources. The resources are represented semantically in a resource object model. A browser kernel of the browser mediates resources access calls from principals. In some implementations the principals are web entities and the resources are peripheral devices. The resource object model separates device semantics from physical device access. Resource access control policies are maintained by the browser kernel and separated from device access mechanisms. | 03-03-2011 |
20110276490 | SECURITY SERVICE LEVEL AGREEMENTS WITH PUBLICLY VERIFIABLE PROOFS OF COMPLIANCE - Techniques are described herein that are capable of providing security guarantees in security service level agreements (SLAB). For instance, a security SLA may specify a level of service to be provided to a user with respect to at least one security property (e.g., confidentiality, integrity, write-serialization, read freshness, etc.). Attestations may be used to prove occurrence (or non-occurrence) of violations of security properties in a manner that is universally verifiable, e.g., by third parties. An attestation is an indicator that is generated by a user to certify that the user makes a request (e.g., get request or put request) or an indicator that is generated by a cloud service provider to certify that the cloud service provider accurately fulfills a request of a user. A security SLA may specify a payment to be made to a user in response to an occurrence of a violation of a security property. | 11-10-2011 |
20110296052 | Virtual Data Center Allocation with Bandwidth Guarantees - A virtual data center allocation architecture with bandwidth guarantees that provides for the creation of multiple virtual data centers from a single physical infrastructure. The virtual data center allocation is accomplished in three steps. First, clusters are created from the servers in the physical infrastructure. Second, a bipartite graph is built to map the virtual machines to the servers located in a particular cluster and finally a path is calculated between two virtual machines. The virtual data centers may be dynamically expanded or contracted based on changing bandwidth guarantees. | 12-01-2011 |
20130212283 | Resource Sharing in Multi-Principal Browser - Techniques for providing resource sharing in a multi-principal browser are described. Resource sharing includes managing a resource for web entity by determining how to divide the resource to share among two or more web entities based at least in part on a Document Object Model (DOM)-recursive resource allocation policy or an application-specified resource allocation policy. A web entity includes a principal instance contending for the resource. The process identifies resource allocation mechanisms from each resource type based at least in part on the DOM-recursive sharing policy or the application-specified resource allocation policy along with the resource type. | 08-15-2013 |
20150071555 | Managing Access by Applications to Perceptual Information - Functionality is described herein by which plural environment-sensing applications capture information from an environment in a fine-grained and least-privileged manner. By doing so, the functionality reduces the risk that private information that appears within the environment will be released to unauthorized parties. Among other aspects, the functionality provides an error correction mechanism for reducing the incidence of false positives in the detection of objects, an offloading technique for delegating computationally intensive recognition tasks to a remote computing framework, and a visualization module by which a user may inspect the access rights to be granted (or already granted) to each application. | 03-12-2015 |
20150074506 | Managing Shared State Information Produced by Applications - A shared renderer maintains shared state information to which two or more augmented reality application contribute. The shared renderer then provides a single output presentation based on the shared state information. Among other aspects, the shared renderer includes a permission mechanism by which applications can share information regarding object properties. The shared renderer may also include: a physics engine for simulating movement of at least one object that is represented by the shared state information; an annotation engine for managing a presentation of annotations produced by plural applications; and/or an occlusion engine for managing the behavior of the output presentation when two or more objects, produced by two or more applications, overlap within the output presentation. | 03-12-2015 |
20150074742 | World-Driven Access Control - Functionality is described herein for managing the behavior of one or more applications, such as augmented reality applications and/or other environment-sensing applications. The functionality defines permission information in a world-driven manner, which means that the functionality uses a trusted mechanism to identify cues in the sensed environment, and then maps those cues to permission information. The functionality then uses the permission information to govern the operation of one or more applications. | 03-12-2015 |
20150074746 | World-Driven Access Control Using Trusted Certificates - Functionality is described herein for receiving events which characterize features in an environment, and for identifying at least one policy based on the events. The functionality consults a certificate, associated with the policy, to determine whether the policy is valid. If valid, the functionality uses the policy to govern the behavior of at least one application, such as by controlling the application's consumption of events. A trusted passport authority may be employed to generate the certificates. Each certificate may: (1) identify that it originated from the trusted passport authority; (2) contain context information which describes a context in which the policy is intended to be applied within an environment; and/or (3) contain machine-readable content that, when executed, carries out at least one aspect of the policy. | 03-12-2015 |
Patent application number | Description | Published |
20090052565 | TURBO CHANNEL ESTIMATION FOR OFDM SYSTEMS - A system and method for estimating a channel in a wireless receiver is disclosed. The method preferably applies to a communication system using the OFDM standard. The method comprises receiving a block of “n” transmitted symbols, the symbols including pilot symbols and “d” data symbols, estimating a channel using the pilot symbols to create a channel estimate, choosing a group of “m” strongest symbols from the “d” received symbols, compensating the “m” strongest symbols using the channel estimate to create a group of “m” compensated symbols, re-estimating the channel using the group of “m” compensated symbols and pilot symbols; and either (1) repeating the steps of choosing a group of “m” strongest symbols, compensating the group of “m” strongest symbols and re-estimating the channel, or (2) using a latest channel estimate to compensate all symbols within the block. The system comprises a wireless receiver having an estimator programmed, for example, using DSP or ASIC and imbedded into the wireless system design software for accomplishing the steps set forth according to the method. | 02-26-2009 |
20100135425 | TURBO CHANNEL ESTIMATION FOR OFDM SYSTEMS - A system and method for estimating a channel in a wireless receiver is disclosed. The method preferably applies to a communication system using the OFDM standard. The method comprises receiving a block of “n” transmitted symbols, the symbols including pilot symbols and “d” data symbols, estimating a channel using the pilot symbols to create a channel estimate, choosing a group of “m” strongest symbols from the “d” received symbols, compensating the “m” strongest symbols using the channel estimate to create a group of “m” compensated symbols, re-estimating the channel using the group of “m” compensated symbols and pilot symbols; and either (1) repeating the steps of choosing a group of “m” strongest symbols, compensating the group of “m” strongest symbols and re-estimating the channel, or (2) using a latest channel estimate to compensate all symbols within the block. The system comprises a wireless receiver having an estimator programmed, for example, using DSP or ASIC and imbedded into the wireless system design software for accomplishing the steps set forth according to the method. | 06-03-2010 |
20130022161 | TURBO CHANNEL ESTIMATION FOR OFDM SYSTEMS - A system and method for estimating a channel in a wireless receiver is disclosed. The method comprises receiving a block of “n” transmitted symbols, the symbols including pilot symbols and “d” data symbols, estimating a channel using the pilot symbols to create a channel estimate, choosing a group of “m” strongest symbols from the “d” received symbols, compensating the “m” strongest symbols using the channel estimate to create a group of “m” compensated symbols, re-estimating the channel using the group of “m” compensated symbols and pilot symbols; and either ( | 01-24-2013 |
20140205044 | TURBO CHANNEL ESTIMATION FOR OFDM SYSTEMS - A system and method for estimating a channel in a wireless receiver is disclosed. The method comprises receiving a block of “n” transmitted symbols, the symbols including pilot symbols and “d” data symbols, estimating a channel using the pilot symbols to create a channel estimate, choosing a group of “m” strongest symbols from the “d” received symbols, compensating the “m” strongest symbols using the channel estimate to create a group of “m” compensated symbols, re-estimating the channel using the group of “m” compensated symbols and pilot symbols; and either (1) repeating the steps of choosing a group of “m” strongest symbols, compensating the group of “m” strongest symbols and re-estimating the channel, or (2) using a latest channel estimate to compensate all symbols within the block. The system comprises a wireless receiver having an estimator programmed according to the method. | 07-24-2014 |
Patent application number | Description | Published |
20090276212 | ROBUST DECODER - Techniques and tools related to delayed or lost coded audio information are described. For example, a concealment technique for one or more missing frames is selected based on one or more factors that include a classification of each of one or more available frames near the one or more missing frames. As another example, information from a concealment signal is used to produce substitute information that is relied on in decoding a subsequent frame. As yet another example, a data structure having nodes corresponding to received packet delays is used to determine a desired decoder packet delay value. | 11-05-2009 |
20100125455 | AUDIO ENCODING AND DECODING WITH INTRA FRAMES AND ADAPTIVE FORWARD ERROR CORRECTION - Various strategies for rate/quality control and loss resiliency in an audio codec are described. The various strategies can be used in combination or independently. For example, a real-time speech codec uses intra frame coding/decoding, adaptive multi-mode forward error correction [“FEC”], and rate/quality control techniques. Intra frames help a decoder recover quickly from packet losses, while compression efficiency is still emphasized with predicted frames. Various strategies for inserting intra frames and signaling intra/predicted frames are described. With the adaptive multi-mode FEC, an encoder adaptively selects between multiple modes to efficiently and quickly provide a level of FEC that takes into account the bandwidth currently available for FEC. The FEC information itself may be predictively encoded and decoded relative to primary encoded information. Various rate/quality and FEC control strategies allow additional adaptation to available bandwidth and network conditions. | 05-20-2010 |
20130294463 | NETWORK JITTER SMOOTHING WITH REDUCED DELAY - A method of compensating for jitter in a packet stream is described. The method comprises placing undecoded frames extracted from packets in the packet stream into a jitter buffer while decoding frames from the jitter buffer and placing the decoded frames into a sample buffer at a rate determined using an average playout delay. The average playout delay is the running average of the playout delay calculated for each packet as each packet becomes available. The playout delay for each packet is the sum of a sample buffer delay and a jitter buffer delay. As each packet is received, the average playout delay is adjusted based on a comparison of the playout delay associated with the received packet to the current average playout delay. | 11-07-2013 |
Patent application number | Description | Published |
20110022434 | Method for evaluating operational and financial performance for dispatchers using after the fact analysis - A method is provided for evaluating operational and financial performance for dispatchers in power grid control centers associated with utility systems. A comprehensive operating plan is provided that applies after the fact analysis for performance metrics, root-cause impacts and process re-engineering. after the fact analysis of past events and practices is performed. Actual system and resource conditions are captured. the system and resource conditions are supplied to a relational database. A scheduler engine receives the actual system and resource conditions from the relational database and processes it to calculate system performance. At least one of the following is displayed, transmission evaluation application displays, reference and scenario cases and associations between them, results presented with a graphical or tabular displays, comparison results between scenario cases and a reference case, a family of curves where each curve is a performance metric, comparison of scenario input data, study results and statistical analysis and historical data. | 01-27-2011 |
20110029147 | Multi-interval dispatch method for enabling dispatchers in power grid control centers to manage changes - A method is provided that enables dispatchers in power grid control centers to manage changes by applying multi-interval dispatch. A multi-stage resource scheduling engine and a comprehensive operating plan are used. Multiple system parameter scenarios are coordinated. | 02-03-2011 |
20110055287 | System tools for evaluating operational and financial performance from dispatchers using after the fact analysis - A decision-support tool is provided to evaluate operational and financial performance for dispatchers in power grid control centers associated with utility systems. A scheduler engine is coupled to a comprehensive operating plan that applies after the fact analysis for performance metrics, root-cause impacts and process re-engineering. A relational database is coupled to a data archiver that captures actual system and resource conditions and then supplies the system and resource conditions to the relational database. The scheduler engine receives the actual system and resource conditions from the relational database and processes it to calculate system performance. A user interface is configured to display at least one of, transmission evaluation application displays, reference and scenario cases and associations between them, results presented with a graphical or tabular displays, comparison results between scenario cases and a reference case, a family of curves where each curve is a performance metric, comparison of scenario input data, study results and statistical analysis and historical data. | 03-03-2011 |
20110071693 | Multi-interval dispatch system tools for enabling dispatchers in power grid control centers to manage changes - A system tool that provides dispatchers in power grid control centers with a capability to manage changes. Included is a user interface and a plurality of scheduler engines. Each scheduler engine is configured to look ahead at different time frames to forecast system conditions and alter generation patterns within the different time frames. A comprehensive operating plan holds schedules generated by the plurality of scheduler engines. A relational database is coupled to the comprehensive operating plan. Input data is initially received from the relational database for each scheduling engine, and thereafter the relational database receives data from the scheduling engines relative to forecast system conditions. | 03-24-2011 |
20150142499 | MULTI-INTERVAL DISPATCH SYSTEM TOOLS FOR ENABLING DISPATCHERS IN POWER GRID CONTROL CENTERS TO MANAGE CHANGES - A system tool that provides dispatchers in power grid control centers with a capability to manage changes. Included is a user interface and a plurality of scheduler engines. Each scheduler engine is configured to look ahead at different time frames to forecast system conditions and alter generation patterns within the different time frames. A comprehensive operating plan holds schedules generated by the plurality of scheduler engines. A relational database is coupled to the comprehensive operating plan. Input data is initially received from the relational database for each scheduling engine, and thereafter the relational database receives data from the scheduling engines relative to forecast system conditions. | 05-21-2015 |
Patent application number | Description | Published |
20080319913 | ANONYMOUS ONLINE PAYMENT SYSTEMS AND METHODS - In various embodiments, a central server grants access to a plurality of anonymous one-time-usable, time-sensitive encrypted tokens that identify consumer purchase orders. A plurality of certified merchant servers are certified by being provided with an application to securely connect the certified merchant servers to the central server for, among other things, transmitting purchase order data to the central server for use in generating the tokens. A plurality of financial institution servers can also be certified by being configured for use with an application that enables secure connection to the central server for, among other things, requesting the tokens. | 12-25-2008 |
20140310181 | ANONYMOUS ONLINE PAYMENT SYSTEMS AND METHODS - In various embodiments, a server grants access to a plurality of anonymous one-time-usable, time-sensitive encrypted tokens that identify consumer purchase orders. A plurality of certified merchant servers are certified by being provided with an application to securely connect the certified merchant servers to the server for, among other things, transmitting purchase order data to the server for use in generating the tokens. A plurality of financial institution servers can also be certified by being configured for use with an application that enables secure connection to the server for, among other things, requesting the tokens. | 10-16-2014 |
Patent application number | Description | Published |
20080244332 | MACHINE INSTRUCTION LEVEL RACE CONDITION DETECTION - An apparatus, method and computer-readable medium provide for detecting and filtering potential race conditions. In one example, potential race conditions may be detected by determining overlap of memory accesses (e.g., read, write). Potential race conditions may be filtered as potentially benign or harmful race conditions using, for example, heuristics, comparison of output states from execution of instructions or operations in differing sequences or identifying of associated output bugs corresponding to the execution of operations in different sequences. | 10-02-2008 |
20120271805 | PREDICTIVELY SUGGESTING WEBSITES - Computer-readable media, computer systems, and computing methods are provided for recommending websites that are relevant to a current website to which a user has navigated. A search engine is used to track a set of websites the user has visited immediately prior to the current website, while predictive model(s) are used to generate a sequence of websites that include the current website and the tracked websites. The sequence is compared against strings of websites within a browser-history log to identify matching strings, where the matching strings include the sequence and a respective candidate website. A probability of relevance is computed from a frequency that each of the matching strings has been visited within a predefined time frame. The probability of relevance for each of the matching strings is ranked against one another to distill the highest-ranked matching strings, which are parsed to extract and present the candidate websites included therein. | 10-25-2012 |
20120278354 | USER ANALYSIS THROUGH USER LOG FEATURE EXTRACTION - Systems, methods, and computer media for efficiently processing user log data are provided. A received user log data analysis request specifies: target user log features that identify users in a target user group, analysis user log features that identify data associated with the users in the target user group, and an analysis to perform on the identified data associated with the users in the target user group. Occurrences of specified features are extracted from user logs and stored. Users associated with an occurrence of each of the extracted and stored target user log features are identified as users in the target user group. Occurrences of the analysis user log features that are associated with a user in the target user group are extracted and reformatted for the analysis specified in the analysis request. | 11-01-2012 |
20120284315 | OPTIMIZATION OF NON-DETERMINISTIC COMPUTATIONAL PATHS - Methods, computer systems and computer readable media for optimizing non-deterministic computational paths are provided. In embodiments, requests are received to generate reports derived from a plurality of series of data files whose metadata attributes form certain mathematical structures that can be used to choose the optimal path in the non-deterministic dependency model. Storage for each of the series of data files is optimized. Available data files needed for the report are processed and missing data files are identified. Based on the mathematical structure of the plurality of series of data files, an optimal transition with the missing data files available is determined. An entry into the transition is triggered and the missing data files are processed. The report is generated and the optimized storage is retained for future requests. | 11-08-2012 |
20130103493 | Search Query and Document-Related Data Translation - The subject disclosure is directed towards developing a translation model for mapping search query terms to document-related data. By processing user logs comprising search histories into word-aligned query-document pairs, the translation model may be trained using data, such as probabilities, corresponding to the word-aligned query-document pairs. After incorporating the translation model into model data for a search engine, the translation model is used may used as features for producing relevance scores for current search queries and ranking documents/advertisements according to relevance. | 04-25-2013 |
20130124492 | Statistical Machine Translation Based Search Query Spelling Correction - Statistical Machine Translation (SMT) based search query spelling correction techniques are described herein. In one or more implementations, search data regarding searches performed by clients may be logged. The logged data includes query correction pairs that may be used to ascertain error patterns indicating how misspelled substrings may be translated to corrected substrings. The error patterns may be used to determine suggestions for an input query and to develop query correction models used to translate the input query to a corrected query. In one or more implementations, probabilistic features from multiple query correction models are combined to score different correction candidates. One or more top scoring correction candidates may then be exposed as suggestions for selection by a user and/or provided to a search engine to conduct a corresponding search using the corrected query version(s). | 05-16-2013 |