Patent application number | Description | Published |
20100205160 | UPDATING AN INVERTED INDEX IN A REAL TIME FASHION - Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes. | 08-12-2010 |
20110202541 | RAPID UPDATE OF INDEX METADATA - Systems and methods for performing an updating process to an in-memory index are provided. Upon receiving notice of document modifications covered by an inverted index associated with a search engine, in the form of an update file, a representation of the modification is published onto various index serving machines. Each index serving machine receiving the update file determines if the modifications are applicable to the index serving machine. If an index serving machine determines that it contains mapping information corresponding to the modified documents, the index serving machine utilizes the update file and associated mapping information to update an in-memory index. In embodiments, the in-memory index is used to provide results to user queries in tandem with the inverted index. In some embodiments, an extra in-memory index is maintained that is revised with constantly incoming metadata updates and the existing in-memory index is periodically swapped with the revised in-memory index. | 08-18-2011 |
20120059806 | UPDATING AN INVERTED INDEX IN A REAL TIME FASHION - Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes. | 03-08-2012 |
20140236962 | Updating An Inverted Index In A Real Time Fashion - Systems and methods for regularly updating portions of a merged index are provided. Initially, upon receiving an indication that modifications have occurred to content of web-based documents, dynamic update of index (DUI) objects that identify the documents and expose the modified content are composed by ascertaining relative positions of the modified content within the documents, and packaging identifiers of the documents, the relative positions, and metadata underlying the modified content into a message. The DUI objects are applied to an overloading index that maintains structured records of recent modifications. In particular, portions of the overloading index are targeted utilizing the document identifiers and the relative positions specified by the DUI object, thereby updating the targeted portions within the overloading index corresponding to the modified content without rewriting the entire overloading index. Periodically, an association process is invoked for grouping the merged index with the overloading index for search purposes. | 08-21-2014 |
Patent application number | Description | Published |
20100318494 | CONVERSION OF AN APPLICATION DATABASE TO MINIMIZE TIME IN SINGLE-USER ACCESS MODE - A method and system for converting source tables of a database of the application to target tables of a new version of the database while reducing the amount of time that the database needs to be open in single-user access mode is provided. A conversion system divides the conversion into a multi-user phase and a single-user phase. During the multi-user phase, the conversion system can perform most of the conversions while the database is opened in multi-user access mode. The conversion system stores the converted data in auxiliary tables, rather than updating the source tables. During the single-user phase, the conversion system performs the remaining conversions and copies data from the source tables and the converted data from the auxiliary tables to the target tables. | 12-16-2010 |
20120246659 | TECHNIQUES TO OPTIMIZE UPGRADE TASKS - Techniques to prioritize and optimize the execution of upgrade operations are described. A technique may include determining the size of data blocks that are to be copied from one storage medium to another, and the dependencies of upgrade tasks on the data blocks and on other tasks. A task may be prioritized according to a weight that includes the cumulative sizes of the data blocks that it and its dependent tasks depend on. A data block copying may be prioritized according to the cumulative weights of the tasks that depend on that data block. Some embodiments may perform several data copying and/or tasks in parallel, rather than sequentially. Other embodiments are described and claimed. | 09-27-2012 |
20120323955 | RELATIONAL MODELING AND RUNTIME FOR DATE EFFECTIVE ENTITIES - A database application may receive a database query to retrieve a relation with date effective information stored by a relational database, and send a database result having the date effective information. The database application may comprise a data mapping component to retrieve a relation definition for the relation from metadata associated with the relation, the relation definition having a relation variable with a set of attributes including multiple date effective attributes, the relation definition having a definition for an alternate key formed from a composite of a date effective attribute and one other attribute from the set of attributes, and a data access component to generate the relation with the date effective information using the alternate key, the relation having a set of one or more tuples, with each tuple having one or more attribute values for corresponding date effective attributes of the relation. Other embodiments are described and claimed. | 12-20-2012 |
Patent application number | Description | Published |
20080281833 | Configuration change management tool - A change management system for managing configurable devices such as computer systems uses a set of rules for validating change requests, linking change requests, and determining inconsistencies within various configuration states. Analysis and validation may happen at the time the change request is created with respect to the current environment, as well as analysis and validation with respect to other pending requests and proposals, and historical actual states. The maintenance of accurate and consistent state and change information may enable various automated tools to analyze and manipulate change requests, including analysis of future desired states, historical actual states, pending change requests, and current state. The change request may be processed through an approval cycle all the while being incorporated into a scheduling system that may be used to detect inconsistent, illogical or harmful configurations in potential future configurations. | 11-13-2008 |
20120287114 | INTERFACE INCLUDING VIEWS POSITIONED IN ALONG MULTIPLE DIMENSIONS - A particular method includes generating an interface that includes a plurality of first views positioned along a first dimension. The interface also includes at least one second view positioned with respect to at least one of the first views along a second dimension. The method also includes transmitting the interface to a display device. | 11-15-2012 |
20120290982 | INTERFACE INCLUDING SELECTABLE ITEMS CORRESPONDING TO SINGLE OR MULTIPLE DATA ITEMS - An interface may include a first portion of a linear scale having first upper and lower bounds and a first plurality of indicators identifying first demarcations of the linear scale between the first upper and lower bounds. A first selectable item corresponding to a single data item and a second selectable corresponding to multiple data items may be arranged along the linear scale. When the second selectable item is selected, the interface may be modified to include a second portion of the linear scale having second upper and lower bounds and the multiple data items corresponding to the second selectable item. | 11-15-2012 |
20130019251 | Value Provider Subscriptions for Sparsely Populated Data ObjectsAANM Kumar; DileepAACI RedmondAAST WAAACO USAAGP Kumar; Dileep Redmond WA USAANM Nowak; MichalAACI BellevueAAST WAAACO USAAGP Nowak; Michal Bellevue WA USAANM Hallock; Joseph W.AACI RentonAAST WAAACO USAAGP Hallock; Joseph W. Renton WA USAANM Modi; KeeronAACI RedmondAAST WAAACO USAAGP Modi; Keeron Redmond WA US - A calling routine may identify portions of a data object that may be populated by other executable routines by creating a property requested event. An event may be created for the requested property and one or more subscribing routines may launch. The subscribing routines may process separately from the calling routine and return property values, which in turn may create a property changed event, which may be subscribed to by the calling routine. The calling routine may then process the requested data. In one embodiment, a data object may be populated on a property-by-property basis by various subscribing routines, creating a sparsely populated data object that may be updated dynamically by routines identified at runtime. | 01-17-2013 |
Patent application number | Description | Published |
20120136706 | Digital Coupon System - Disclosed are various embodiments for a digital coupon system. Digital coupons can be defined by a coupon specification received from a coupon issuer. Digital coupons can be issued to users and redeemed with third party retailer sites and/or point of sale systems. A coupon clearing house application can manage distribution, redemption, reimbursement of retailers and invoicing of coupon issuers. | 05-31-2012 |
20120136707 | Digital Coupon System - Disclosed are various embodiments for a digital coupon system. Digital coupons can be defined by a coupon specification received from a coupon issuer. Digital coupons can be issued to users and redeemed with third party retailer sites and/or point of sale systems. A coupon clearing house application can manage distribution, redemption, reimbursement of retailers and invoicing of coupon issuers. | 05-31-2012 |
20120136708 | Digital Coupon System - Disclosed are various embodiments for a digital coupon system. Digital coupons can be defined by a coupon specification received from a coupon issuer. Digital coupons can be issued to users and redeemed with third party retailer sites and/or point of sale systems. A coupon clearing house application can manage distribution, redemption, reimbursement of retailers and invoicing of coupon issuers. | 05-31-2012 |
20120136710 | Digital Coupon System - Disclosed are various embodiments for a digital coupon system. Digital coupons can be defined by a coupon specification received from a coupon issuer. Digital coupons can be issued to users and redeemed with third party retailer sites and/or point of sale systems. A coupon clearing house application can manage distribution, redemption, reimbursement of retailers and invoicing of coupon issuers. | 05-31-2012 |
20120136712 | Digital Coupon System - Disclosed are various embodiments for a digital coupon system. Digital coupons can be defined by a coupon specification received from a coupon issuer. Digital coupons can be issued to users and redeemed with third party retailer sites and/or point of sale systems. A coupon clearing house application can manage distribution, redemption, reimbursement of retailers and invoicing of coupon issuers. | 05-31-2012 |
20140350710 | Tote Based Item Tracking - This disclosure describes a system for managing inventory as it transitions into a materials handling facility, as it transitions between locations within a materials handling facility and/or as it transitions out of a materials handling facility. In some instances, a user (e.g., picker or picking agent) may retrieve an item from an inventory location and place the item into a tote. The systems described herein detect the item when it is added to or removed from the tote. | 11-27-2014 |
20140350711 | Inventory Tracking - This disclosure describes a system for managing inventory as it transitions into a materials handling facility, as it transitions between locations within a materials handling facility and/or as it transitions out of a materials handling facility. In some instances, a user (e.g., picker or picking agent) may retrieve an item from an inventory location and place the item into a tote. The systems described herein detect the item when it is added to or removed from the tote. | 11-27-2014 |
20140350715 | Inventory Transitions - This disclosure describes a system for managing inventory as it transitions into a materials handling facility, as it transitions between locations within a materials handling facility and/or as it transitions out of a materials handling facility. In some instances, a user (e.g., picker or picking agent) may retrieve an item from an inventory location and place the item into a tote. The systems described herein detect the item when it is added to or removed from the tote. | 11-27-2014 |
20150019391 | DETECTING ITEM INTERACTION AND MOVEMENT - This disclosure describes a system for tracking removal or placement of items at inventory locations with a materials handling facility. In some instances, a user may remove an item from an inventory location and the inventory management system may detect that removal and update a user item list associated with the user to include an item identifier representative of the removed item. Likewise, if the user places an item at an inventory location, the inventory management system may detect that placement and update the user item list to remove an item identifier representative of the placed item. | 01-15-2015 |
Patent application number | Description | Published |
20100324979 | COMPUTER-BASED ANALYSIS OF AFFILIATE SITE PERFORMANCE - A performance analysis system analyzes the performance of affiliate sites that provide links to specific items in an electronic catalog, and identifies catalog items that can be listed by such affiliate web sites to improve performance. An association mining component analyzes transaction data attributable to specific categories or types of affiliate web sites to identify items that are frequently purchased in combination by users of such sites. The detected item associations are used to evaluate, for a given affiliate site, whether significant disparities exist between the expected and actual sales quantities of specific items. The results of the analysis are incorporated into affiliate-specific performance reports, which may include specific recommendations for improving performance. The disclosed methods may also be used to analyze the performance of, and provide recommendations to, online sellers within an online mall, online marketplace, or online auction system. | 12-23-2010 |
20110106598 | Surfacing Digital Coupons to Customers - Various systems, methods, and other embodiments are described relating to the selection of digital coupons for display in network pages. In one embodiment, a plurality of coupon campaigns are maintained in a computing device for a plurality of entities in association with an operation of an electronic commerce system employed to sell a plurality of items over a network. Each of the coupon campaigns comprises at least one digital coupon to be applied to a purchase of at least one of the items. A network page is generated in the electronic commerce system to be rendered on a client. The network page is generated in association with the operation of the electronic commerce system. A subset of the digital coupons is determined to be included in the network page to present to a user. | 05-05-2011 |
20110106599 | Providing Digital Coupons for Third Party Network Sites - Various embodiments, including systems and methods, are described for providing digital coupons to third party network sites. In one representative embodiment, a computing device is provided, where a plurality of digital coupons are maintained in a memory associated with the computing device. Each digital coupon is directed to the purchase of at least one item through an electronic commerce system. A coupon service is implemented in the computing device that is configured to identify at least one of the digital coupons to present on a third party network site in response to a request for at least one of the digital coupons received from the third party network site based at least in part upon information contained in the request. The identified digital coupons are then sent to the third party network site. | 05-05-2011 |
20110106603 | Self-Service Implementation of Digital Coupons - Disclosed are various embodiments relating to a self-service portal for coupon implementation in association with an electronic commerce system. Coupon campaigns are implemented in a computing device for a plurality of vendors in association with the electronic commerce system. Each of the coupon campaigns comprises one or more digital coupons. An automated submission of each of the campaigns is facilitated in the computing device from respective ones of the vendors through a self-service portal. Vendor control is facilitated through the self-service portal as to whether the digital coupons associated with a respective one of the campaigns are activated to be applied to a purchase of an item through the electronic commerce system. | 05-05-2011 |
20120245976 | COMPUTER-BASED ANALYSIS OF SELLER PERFORMANCE - A performance analysis system analyzes the performance of affiliate sites that provide links to specific items in an electronic catalog, and identifies catalog items that can be listed by such affiliate sites to improve performance. An association mining component analyzes transaction data attributable to specific categories of affiliate sites to identify items that are frequently purchased in combination by users of such sites. The detected item associations are used to evaluate, for a given affiliate site, whether significant disparities exist between the expected and actual sales quantities of specific items. The results of the analysis are incorporated into affiliate-specific performance reports, which may include specific recommendations for improving performance. The disclosed methods may also be used to analyze the performance of, and provide recommendations to, online sellers within an marketplace or auction system. | 09-27-2012 |
Patent application number | Description | Published |
20080294602 | DOMAIN COLLAPSING OF SEARCH RESULTS - Systems, methods, computer-readable media, and graphical user interfaces for presenting search results having collapsed domains are provided. A search result obtaining module obtains search results based upon a received query. Upon obtaining the search results, search results having the same domain are associated with one another. Thereafter, search result clusters of associated search results are formed. In some embodiments, the search result clusters may be formatted to include desired search result cluster attributes. The search result clusters are presented such that two or more associated search results form a single cluster of search results rather than being presented individually. In some embodiments, an option to view more search results with the same domain may be provided. | 11-27-2008 |
20090063457 | AUGMENTING URL QUERIES - Computer-readable media, systems, and methods for augmenting URL queries are described. In embodiments, a URL query is received from a user and it is determined whether the URL query is a simple URL query. Further, if the URL query is a simple URL query, an augmented query is created by word-breaking at least a portion of the URL query and the augmented query is associated with one or more ranking preferences. In various other embodiments, a URL query is received from a user and it is determined whether the URL query is a complex URL query. Further, if the URL query is a complex URL query, an augmented query is created that is identical to the URL query and the augmented query is associated with one or more ranking preferences. | 03-05-2009 |
20090089286 | DOMAIN-AWARE SNIPPETS FOR SEARCH RESULTS - Techniques are disclosed for providing a domain-aware snippet for a search result. With such techniques, a domain classification component is provided for identifying a template used to generate a plurality of web pages of a domain, associating the template and content of the web pages related to the template with a Uniform Resource Locator pattern of the plurality of web pages, and storing the associated template, the related content, and the Uniform Resource Locator pattern in a database. A snippet extraction component is also provided for extracting text from a section of a web page of the plurality of web pages for a snippet of a search result corresponding to a search query, wherein the extracted text is based on a ranking value of the section and the relevance of the extracted text to the search query. | 04-02-2009 |
20120215755 | DOMAIN-AWARE SNIPPETS FOR SEARCH RESULTS - Techniques are disclosed for providing a domain-aware snippet for a search result. A uniform resource locator (URL) is identified for a search result obtained in response to a search query, and it is determined that the URL corresponds to a single domain that has a plurality of web pages that are generated using a template that is common to each of the web pages in the domain. The template comprises a hypertext markup language (HTML) layout pattern that includes multiple sections shared by the web pages. A ranking value is assigned to the multiple sections and is used to identify a first section of the template that is relevant to the search query. A snippet is provided to a user for the search result; the snippet includes at least a portion of text from the first section. | 08-23-2012 |
Patent application number | Description | Published |
20120158702 | Classifying Results of Search Queries - Computer-readable media, computer systems, and computing methods are provided for classifying search results as either of good quality or of poor quality. Initially, a portion of the search results, such as the highest ranked documents, are selected for evaluation. A level of quality for each of the selected search results is determined using a classification process that includes the following steps: targeting features demonstrated by the selected search results to be evaluated; evaluating the selected features to generate a level-of-quality score for each of the selected search results; comparing the score against a predefined threshold value; and, based on the comparison, assigning each of the selected search results an absolute measurement. The absolute measurement indicates poor quality when the score is less than the threshold value. Upon recognizing that the selected search results are of poor quality, automatically executing a corrective action that reformulates the issued search query. | 06-21-2012 |
20120158765 | User Interface for Interactive Query Reformulation - Computer-readable media, computer systems, and computing methods are provided for classifying search results as either of good quality or of poor quality. Initially, a portion of the search results, such as the highest ranked documents, are selected for evaluation. A level of quality for each of the selected search results is determined using a classification process that includes the following steps: targeting features demonstrated by the selected search results to be evaluated; evaluating the selected features to generate a level-of-quality score for each of the selected search results; comparing the score against a predefined threshold value; and, based on the comparison, assigning each of the selected search results an absolute measurement. The absolute measurement indicates poor quality when the score is less than the threshold value. Upon recognizing that the selected search results are of poor quality, a corrective action that reformulates the issued search query is automatically invoked. | 06-21-2012 |
20120197905 | INFORMATION RETRIEVAL USING SUBJECT-AWARE DOCUMENT RANKER - Subject matter described herein is related to determining a document score, which suggests a relevance of a document (e.g., webpage) to a search query. For example, a search query is received that is comprised of one or more terms, which represent a subject. An equivalent subject is identified that is semantically similar to the subject. The document score is determined by accounting for both a subject frequency and an equivalent-subject frequency. | 08-02-2012 |
20120233096 | OPTIMIZING AN INDEX OF WEB DOCUMENTS - Historical usage data related to user queries and training properties for a plurality of web pages is received and utilized to train a mathematical model to predict the likelihood of retrieval of a web page during a web search. Properties are extracted from the plurality of web pages in the index and the mathematical model is applied to the properties for each web page to calculate a sortrank value. The index is reordered based on the sortrank value such that the web pages most likely to be retrieved by a user submitting a search query appear first in the index. After a search query is received from a user the index is traversed in an order determined by the sortrank value. Responsive web pages are presented to the user in an order determined by a search engine ranking algorithm. | 09-13-2012 |
20130254189 | Using Anchor Text to Provide Context - A search engine can provide referencing information as context for a particular search result when an excerpt from the search result, comprising at least some similar elements to the user's query, is not generated. Referencing information can include one or more anchor texts having similarity to at least some elements of the user's query, the anchor texts being used by referencing pages to link to the page returned as a search result. User selection of the anchor text can enable the user to visit a referencing page using that anchor text to link to the page returned as a search result, and having a high static rank. | 09-26-2013 |
20130268511 | URL Annotations - A search engine configured to respond to a search query with a search results page is presented. The search engine includes at least one annotated search result in the search results page. The at least one annotated search results is annotated according to user data independent of the basis by which the search results are identified. The search results page is generated to include user-actionable controls by which a user can update the search results according to update criteria. The update criteria is used in a feedback loop to improve the user data upon which search results are personalized and/or annotated. | 10-10-2013 |
Patent application number | Description | Published |
20120317207 | Directing Messages Based On Domain Names - A communication system has a plurality of collections. Each collection comprises a security boundary within which private data is accessible. Each collection is associated with a director. The directors receive messages that specify domains. When a director for a given collection receives a message, the director identifies one of the collections as being a home collection for the domain specified by the message. If the specified domain's home collection is the given collection or another collection within a given privacy boundary, the director forwards the message to a server pool associated with the specified domain's home collection. Otherwise, if the specified domain's home collection is not within the given privacy boundary, the director forwards the message to the director of the specified domain's home collection. | 12-13-2012 |
20140136878 | Scaling Up and Scaling Out of a Server Architecture for Large Scale Real-Time Applications - Scaling up and scaling out of a server architecture for large scale real-time applications is provided. A group of users may be provisioned by assigning them to a server pool and allotting them to a group. Grouped users help to reduce inter-server communication when they are serviced by the same server in the pool. High availability may be provided by choosing a primary server and one or more secondary servers from the pool to ensure that grouped users are serviced by the same server. Operations taken on the primary server are synchronously replicated to secondary servers so that when a primary server fails, a secondary server may be chosen as the primary for the group. Servers for multiple user groups may be load balanced to account for changes in either the number of users or the number of servers in a pool. Multiple pools may be paired for disaster recovery. | 05-15-2014 |
20140137187 | Scalable and Highly Available Clustering for Large Scale Real-Time Applications - Scaling and highly available clustering for large scale real-time applications is provided. A ring may be formed which includes multiple nodes for providing a set of services in a system. When a network partition is detected which affects communications between each of the nodes in the ring, the formation of additional rings is prevented by shutting down nodes which include a minority of voting nodes in the ring while maintaining the availability of the nodes which include a majority of the voting nodes to continue providing the set of services in the system. | 05-15-2014 |
20150078332 | VOICE CALL CONTINUITY IN HYBRID NETWORKS - Voice call continuity is provided for calls that are carried over a hybrid network infrastructure in which access connections are distributed over loosely coupled network portions including a backend network such as a core VoIP (Voice over Internet Protocol) service network, one or more cellular mobile networks, and a public switched telephone network (“PSTN”). The calls are routed through the core VoIP network regardless of their points of origination or termination in other network portions so that signaling and call context are anchored in the core VoIP network. The conditions under which user equipment operate are continuously monitored so that when a connection is determined to have been unacceptably degraded or is likely to be interrupted, and/or a more optimal connection is available, a handover of the call to another connection is initiated so that call continuity is maintained using the lowest cost connection that provides acceptable call quality. | 03-19-2015 |
Patent application number | Description | Published |
20120278220 | FORWARD-LOOKING TRANSACTIVE PRICING SCHEMES FOR USE IN A MARKET-BASED RESOURCE ALLOCATION SYSTEM - Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. One of the disclosed embodiments is a method for generating a bid value for purchasing electricity in a market-based resource allocation system. In this embodiment, a desired performance value indicative of a user's desired performance level for an electrical device is received. Price information from an electricity futures market is received. A bid value for purchasing electricity from a local resource allocation market sufficient to operate the electrical device at the desired performance level is computed. In this embodiment, the computing is performed based at least in part on the desired performance value and based at least in part on the price information from the electricity futures market. | 11-01-2012 |
20130218743 | FORWARD-LOOKING TRANSACTIVE PRICING SCHEMES FOR USE IN A MARKET-BASED RESOURCE ALLOCATION SYSTEM - Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. One of the disclosed embodiments is a method for generating a bid value for purchasing electricity in a market-based resource allocation system. In this embodiment, a desired performance value indicative of a user's desired performance level for an electrical device is received. Price information from an electricity futures market is received. A bid value for purchasing electricity from a local resource allocation market sufficient to operate the electrical device at the desired performance level is computed. In this embodiment, the computing is performed based at least in part on the desired performance value and based at least in part on the price information from the electricity futures market. | 08-22-2013 |
20130218744 | FORWARD-LOOKING TRANSACTIVE PRICING SCHEMES FOR USE IN A MARKET-BASED RESOURCE ALLOCATION SYSTEM - Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. One of the disclosed embodiments is a method for generating a bid value for purchasing electricity in a market-based resource allocation system. In this embodiment, a desired performance value indicative of a user's desired performance level for an electrical device is received. Price information from an electricity futures market is received. A bid value for purchasing electricity from a local resource allocation market sufficient to operate the electrical device at the desired performance level is computed. In this embodiment, the computing is performed based at least in part on the desired performance value and based at least in part on the price information from the electricity futures market. | 08-22-2013 |
20130254090 | FORWARD-LOOKING TRANSACTIVE PRICING SCHEMES FOR USE IN A MARKET-BASED RESOURCE ALLOCATION SYSTEM - Disclosed herein are representative embodiments of methods, apparatus, and systems for distributing a resource (such as electricity) using a resource allocation system. One of the disclosed embodiments is a method for generating a bid value for purchasing electricity in a market-based resource allocation system. In this embodiment, a desired performance value indicative of a user's desired performance level for an electrical device is received. Price information from an electricity futures market is received. A bid value for purchasing electricity from a local resource allocation market sufficient to operate the electrical device at the desired performance level is computed. In this embodiment, the computing is performed based at least in part on the desired performance value and based at least in part on the price information from the electricity futures market. | 09-26-2013 |
Patent application number | Description | Published |
20100094915 | Quick-Creating Objects in an Application - A palette of representations that can be generated by an application for database, spreadsheet, word processing, and the like, is provided in response to a request for a new object within the application. If the application already has one or more objects open at the time of the request, the representations are also determined based on the context of the data such as from any currently open object(s). The new object is then generated based on the selected representation from the palette, the context of the data, and a structure of data consumed by the application. The layout parameters for the new object are automatically set based on the current context, the structure of the data, and the selected representation. | 04-15-2010 |
20140032590 | WINDOWED MID-TIER DATA CACHE - Technologies are described herein for implementing a windowed mid-tier data cache. A request is received for a data page comprising a set of data rows from a result set of a query in a database management system (“DBMS”). A determination is made whether the requested data rows exist in the mid-tier cache. If the requested rows exist in the cache, then the set of data rows is retrieved from the cache and the requested data page is returned. If the requested rows do not exist in the cache, a data chunk comprising a number of data rows from the result set larger than and encompassing the requested rows is requested from the DBMS. Upon receiving the data chunk, the data chunk is stored in the mid-tier cache, and the set of data rows are retrieved from the cache and the requested data page is returned. | 01-30-2014 |
Patent application number | Description | Published |
20090083272 | Role-based user tracking in service usage - Devising a centralized usage database for tracking and recording the usage of various services by various users may be difficult for several reasons, including the volume of data generated by each user in interacting with each service. Techniques are disclosed for streamlining usage data transmitted between the services, the users, and the usage database, such as by redistributing a portion of the computational burden to the users, and by characterizing the usage data based on the role of each user in interacting with each service. Additional techniques are disclosed for caching and authenticating the usage data, and for improving the response rate in the interaction of the usage database with users in order to provide a better user experience. | 03-26-2009 |
20090083367 | User profile aggregation - User profile data that may be spread across different service providers and that may vary across different service providers can be aggregated to provide an aggregate user profile. An aggregate user profile can be generated regardless of, among other things, varying user profile semantics, differing data formats, data item conflicts, evolving server protocols and interfaces, and updates to the number, identity, location, and type of servers upon which the service providers are maintained. | 03-26-2009 |
Patent application number | Description | Published |
20120084641 | SECURELY RENDERING ONLINE ADS IN A HOST PAGE - One or more techniques and/or systems are disclosed for rendering online ads on a webpage. A first inter-frame communication channel is created, which comprises a first communication channel between a first cross-domain frame and a host page, such as the webpage. The first cross-domain frame comprises content from a domain that is different than that of the host page domain. A second inter-frame communication channel is created comprising a second communication channel between the first cross-domain frame and a second cross-domain frame in the host page. | 04-05-2012 |
20120159307 | RENDERING SOURCE REGIONS INTO TARGET REGIONS OF WEB PAGES - A target web page may embed resources hosted by a source server. However, this embedding may result in compatibility and/or security issues; e.g., the dimensions of the embedded resource may skew the layout of the target web page. Instead, a source web page may be rendered separately from a target web page, and a source region of the source web page (e.g., a region defined by a set of coordinates) may be extracted from the source web page and may be presented in a target region of the target web page. The elements of the source region may be displayed and executed in isolation within the source web page, and may operate within a source domain (e.g., communicating with the source server and accessing cookies stored by the source server), yet may not interact with the elements of the target web page, thereby alleviating many compatibility and security problems. | 06-21-2012 |
20130086178 | DELIVERING AN IN-APPLICATION MESSAGE - One or more techniques and/or systems are disclosed for identifying an in-application message to display to a user. A user may perform a user action in an application, which can be identified. The identified user action can be compared to metadata data associated with a plurality of in-application messages for the application, and an in-application message that is eligible for display to the user can be identified based on the user action. A determination can be made whether to display the eligible message to the user in the application, based upon one or more in-application messages that the user may have previously viewed, as may be found or tracked in a user message viewing history. | 04-04-2013 |
20130086194 | SERVICE OUTAGE DETAILS IN AN ERROR MESSAGE - One or more techniques and/or systems are disclosed for providing a customized service error message to a user of a service. An error encountered during a user action related to the service may be compared to one or more identified service outages to determine if the error may be attributable to any of the service outages. If the error may be caused by one or more of the identified service outages, the customized service error message can be provided, where the customized service error message comprises information about one or more of the identified service outages that cover the error. The customized service error message may be displayed to the user so that the user knows that the error is server/service side (e.g., as opposed to an issue on the user's local device), a timeframe within which the error is expected to be resolved, etc. | 04-04-2013 |
Patent application number | Description | Published |
20100223443 | MULTI-PROTOCOL ACCESS TO FILES AND DIRECTORIES - An operating system is provided. The system includes an agent component to monitor computer activities between one or more single-item access components and one or more set-based access components. A protocol component is employed by the agent component to mitigate data access between the single-item access components and the set-based access components. | 09-02-2010 |
20110289100 | MANAGING A BINARY OBJECT IN A DATABASE SYSTEM - A method for managing a binary object in a database system is provided. The method may include receiving a request to store the binary object and determining if a size of the binary object is above a first threshold. If the size is less than the first threshold, the method may include storing the binary object in a database of the database system using a database communication protocol. If the size is above the first threshold, the method may include determining if the size is above a second threshold. To this end, if the size is less than the second threshold, the method may include storing the binary object in a file system of the database system using the database communication protocol. Furthermore, if the size is above the second threshold, the method may include storing the binary object in the file system using a file system communication protocol. | 11-24-2011 |
20120303667 | MANAGING A BINARY OBJECT IN A DATABASE SYSTEM - A method for managing a binary object in a database system is provided. The method may include receiving a request to store the binary object and determining if a size of the binary object is above a first threshold. If the size is less than the first threshold, the method may include storing the binary object in a database of the database system using a database communication protocol. If the size is above the first threshold, the method may include determining if the size is above a second threshold. To this end, if the size is less than the second threshold, the method may include storing the binary object in a file system of the database system using the database communication protocol. Furthermore, if the size is above the second threshold, the method may include storing the binary object in the file system using a file system communication protocol. | 11-29-2012 |
Patent application number | Description | Published |
20080281833 | Configuration change management tool - A change management system for managing configurable devices such as computer systems uses a set of rules for validating change requests, linking change requests, and determining inconsistencies within various configuration states. Analysis and validation may happen at the time the change request is created with respect to the current environment, as well as analysis and validation with respect to other pending requests and proposals, and historical actual states. The maintenance of accurate and consistent state and change information may enable various automated tools to analyze and manipulate change requests, including analysis of future desired states, historical actual states, pending change requests, and current state. The change request may be processed through an approval cycle all the while being incorporated into a scheduling system that may be used to detect inconsistent, illogical or harmful configurations in potential future configurations. | 11-13-2008 |
20090183185 | Declarative and Extensible Process Definition - An enterprise application may operate on a platform that is able to execute a solution pack that may have various configurable items incorporated into the solution pack. During runtime, the platform may present the configurable items in a user interface. The items may be embedded within the solution pack, which may contain various descriptors of a business process, including workflow definitions, data types handled in the process, and various rules or other definitions. The options made available within the solution pack may alter the workflow, alter conditions used within the workflow, change data types, or change any other element. The options may also be made available through an application programming interface to the platform. | 07-16-2009 |
20100077338 | METHOD AND SYSTEM OF TASKBAR BUTTON INTERFACES - The present invention provides a system or method for displaying rich presentation taskbar buttons for a corresponding application. In one example, the rich presentation taskbar button may receive content from an application through a programming interface. The present invention further relates to a system and method for displaying a rich presentation taskbar button and for displaying and/or dismissing a thumbnail of an application window associated with the rich presentation taskbar button. The present invention may further include a system and method of pinning the thumbnail on a display or dismissing a thumbnail. The present invention also relates to a system and method for displaying multiple taskbar buttons in a taskbar including controlling the size of individual taskbar buttons, consolidating taskbar buttons and placing taskbar buttons into an overflow based on the type of taskbar button in the taskbar. | 03-25-2010 |
20140195962 | METHOD AND SYSTEM OF TASKBAR BUTTON INTERFACES - The present invention provides a system or method for displaying rich presentation taskbar buttons for a corresponding application. In one example, the rich presentation taskbar button may receive content from an application through a programming interface. The present invention further relates to a system and method for displaying a rich presentation taskbar button and for displaying and/or dismissing a thumbnail of an application window associated with the rich presentation taskbar button. The present invention may further include a system and method of pinning the thumbnail on a display or dismissing a thumbnail. The present invention also relates to a system and method for displaying multiple taskbar buttons in a taskbar including controlling the size of individual taskbar buttons, consolidating taskbar buttons and placing taskbar buttons into an overflow based on the type of taskbar button in the taskbar. | 07-10-2014 |
Patent application number | Description | Published |
20120214542 | AUTOMATIC ANSWERING OF A MOBILE PHONE - The present disclosure relates to a mobile phone and a method for answering such a phone automatically without user input. In one embodiment, the mobile phone detects that a call is being received. A proximity sensor is then used to detect the presence of a nearby object. For example, this allows a determination to be made whether the mobile phone is within a pocket of the user while the phone is ringing. Then a determination is made whether the proximity sensor changes states. For example, if a user removes the phone from their pocket, the proximity sensor switches from detecting something proximal to detecting that the phone is no longer in the user's pocket. Next, a determination is made whether the proximity sensor is again next to an object, such as an ear. If so, the mobile phone can be automatically answered without further user input. | 08-23-2012 |
20130131972 | COMPUTING-DEVICE LOCALIZATION BASED ON INERTIAL SENSORS - Technology is described for determining a location at which a computing device is positioned. For example, a computing device is positioned in an area (e.g., building), and a map (e.g., floor plan) is retrieved that depicts the area. An initial location of the computing device is determined with respect to the map. Inertial sensors record motion inputs (e.g., acceleration, orientations, etc.), which are analyzed to determine a path along which the computing device moves. The path is applied to the initial location to determine an updated location at which the computing device may be located. | 05-23-2013 |
20130324194 | AUTOMATIC ANSWERING OF A MOBILE PHONE - The present disclosure relates to a mobile phone and a method for answering such a phone automatically without user input. In one embodiment, the mobile phone detects that a call is being received. A proximity sensor is then used to detect the presence of a nearby object. For example, this allows a determination to be made whether the mobile phone is within a pocket of the user while the phone is ringing. Then a determination is made whether the proximity sensor changes states. For example, if a user removes the phone from their pocket, the proximity sensor switches from detecting something proximal to detecting that the phone is no longer in the user's pocket. Next, a determination is made whether the proximity sensor is again next to an object, such as an ear. If so, the mobile phone can be automatically answered without further user input. | 12-05-2013 |
Patent application number | Description | Published |
20080236463 | Methods of managing timberland - A method of managing timberland generally includes planting a softwood tree crop in first and second rows, wherein the tree crop has a tree spacing between adjacent trees and a row spacing between the first and second rows. The method further includes planting an energy crop in the row spacing, wherein the energy crop is a regenerating lignocellulosic energy crop. The method further includes periodically harvesting the energy crop for a predetermined number of harvests. | 10-02-2008 |
20120031314 | METHODS OF MANAGING TIMBERLAND - A method of managing timberland to optimize the combined revenue of a softwood tree crop and an energy crop generally includes planting a softwood tree crop in adjacent first and second rows, wherein the softwood tree crop has a tree spacing between adjacent trees and a row spacing in the range of about 15 to about 25 feet between the first and second rows, planting an energy crop in the row spacing, wherein the energy crop is a regenerating lignocellulosic energy crop, and periodically harvesting the energy crop. Methods of managing timberland to optimize the plot growth rate for a plot including a softwood tree crop and an energy crop, and to optimize the total plot volume of a softwood tree crop and an energy crop are also provided. | 02-09-2012 |
20140137470 | METHODS OF MANAGING TIMBERLAND - A method of managing timberland to optimize the plot growth rate for a plot including a softwood tree crop and an energy crop generally includes planting a softwood tree crop in adjacent first and second rows, wherein the softwood tree crop has a tree spacing between adjacent trees and a row spacing between the first and second rows, planting an energy crop in the row spacing, wherein the energy crop is a regenerating lignocellulosic energy crop, and periodically measuring the plot growth of the softwood tree crop and the energy crop. A method of managing timberland to optimize the total plot volume of a softwood tree crop and an energy crop generally includes periodically measuring the total plot volume of the softwood tree crop and the energy crop. | 05-22-2014 |