摘要:
One or more models of memorability are provided that facilitate various computer-based applications including those centering on the storage, retrieval, and processing of information, applications that remind people about items they risk not recalling or overlooking, and facilitating communications of reminders. In one application, the models are used to help compose and navigate large personal stores of information about a user's activities, communications, images, and other content. In another application, views of files in directories are extended with the addition of memory landmarks, and a means for controlling the number of landmarks provided via changing a threshold on inferred memorability. Another application centers on the use of models of memorability to select subsets of images from larger sets representing events, for display in a slide show or ambient photo display. In another application, a system is provided that facilitates computer-based searching for information by providing for the design and analysis of timeline visualizations in connection with displaying results to queries based at least in part on an index of content. A query is received by a query component (which can be part of search engine that provides a unified index of information a user has been exposed to). The query component parses the query into portions relevant to effecting a meaningful search in accordance with the subject invention. The query component can access and populate a data store which may include information searched for. A landmark component receives and/or accesses information from the query component as well as the data store, and anchors public and/or personal landmark events to search results-related information.
摘要:
The present invention relates to systems and methods that predict behaviors of alerting and filtering systems based on simulation from messaging logs. By logging contextual information, such as the presence, activity, and availability of users, as well as incoming messages and their properties, forecasting services can be created that serve to provide users with an interactive “what if” capability, informing them what they might expect in terms of future behaviors of an automated message alerting and/or filtering system, based on recent messaging histories. A log of the history of incoming messages and contextual data is examined by modeling and simulation tools. The tools reveal the influence of alternate settings on the system's behavior, in response to an expected stream of incoming messages, providing users with insights about how control settings affect alerting, filtering, or routing behaviors.
摘要:
A location system for locating and determining the motion and velocity of a wireless device. The methods include direct inferences about whether a device is in motion versus static based on a statistical analysis of the variation of radio signal strengths over time. The system is trained according to a sparse set of identified locations from which signal strengths are measured. The system uses the signal properties of the identified locations to interpolate for a new location of the wireless device. The system uses a probabilistic graph where the identified locations of the floor plan, expected walking speeds of pedestrians, and independent inference of whether or not the device is in motion are used to determine the new location of the device.
摘要:
The present invention employs approximate device locations determined from changes in the sensed strength of radio signals at different locations. In one instance of the invention, the approximate device locations are based on inference procedures that are used to process ambient commercial radio signals, to estimate a location or a probability distribution over the locations of a device. In another instance of the invention, approximate device locations derived from learning and inference methods that are applied to rank vector of signal strength vectors are utilized. Moving to such rank orderings leads to methods that bypass consideration of absolute signal strengths in location calculations. The invention utilizes approximations for a device location that is based on a method that does not require a substantial number of available ambient signal strengths while still providing useful location inferences in determining locations. Several location-centric services are supported, including receipt of location-specific information such as traffic reports, emergency information, transmission about device location, and time-sensitive promotions such as discounts offered by businesses for load balancing the provision of services.
摘要:
Modulating the behavior of an agent for directing automated services such as for messaging and scheduling is disclosed. In one embodiment, a computer-implemented method inputs an action probability. The action probability has a location within a region corresponding to an option that in one embodiment can be one of: (1) inaction, (2) automatic action, and (3) engaging the user in a dialog about the user's desire for automated action, followed by action pending receipt of user approval. The method then modulates the behavior of the agent depending on the location of the action probability within the region. In one embodiment, the region in which the action probability is located is divided into two or more sub-regions, such that the behavior of the agent is modulated based on which sub-region in which it lies. In another embodiment, a continuous function is imposed onto the region in which the probability is located, where the function yields a confidence level based on the location of the action probability within the region, such that the behavior of the agent is modulated based on this confidence level.
摘要:
Directing automated services for messaging and scheduling. In one embodiment, a computer-implemented method first determines a message to analyze. The method then determines the probability that the user would like to review a calendar or to schedule an appointment based on information in the message, based on the message, and based on the scheduling probability, selects one of the following options: (1) inaction, (2) automatic action, or (3) suggested action with user approval. Upon the method selecting either the (1) automatic action option or the (2) suggested action with user approval option—the latter also in conjunction with receiving actual user approval—the method performs a scheduling action based on the message in a manner that takes into consideration the precision and confidence of the scheduling action.
摘要:
A decision-theoretic regulator employs a method for allocating computational resources to components of media content to create the highest quality output for a budget of rendering resources. The components of the content represent parts of the content that have independent quality parameters that the regulator can vary to trade-off quality for computational savings. For example, in multimedia content, the components might be objects in a 3D graphics scene. The method allocates computational resources by attempting to minimize the total expected cost of a rendering task. The method computes the raw error for a rendering action on a component and then maps the raw error to a perceived error based on empirical evidence of how users perceive errors in rendered output. The expected cost is computed from the perceived error or raw error by applying a model of attention that gives the probability that a user is focusing his or her attention on a component. The method minimizes the total expected cost by selecting a rendering action for each component that yields the lowest expected cost for a given rendering budget.
摘要:
A technique, specifically apparatus and accompanying methods for use therein, that, through continual computation, harnesses available computer resources during periods of low processing activity and low network activity, such as idle time, for prefetching, e.g., web pages, or pre-selected portions thereof, into local cache of a client computer. As the browser prefetches and stores each web page (or component thereof) in its local cache, the browser provides a suitable and preferably visual indication, through its graphical user interface, to a user that this item has been fetched and stored. Consequently, the user can quickly and visually perceive that a particular item (i.e., a “fresh” page or portion) has just been prefetched and which (s)he can now quickly access from local cache. As such additional items are cached, the browser can change the color of the displayed hotlink associated with each of the items then stored in cache so as, through color coding, to reflect their relative latency (“aging”) in cache.
摘要:
Apparatus and accompanying methods for optimally using available computer resources, illustratively processing time, and which can be advantageously used for selecting task(s) instances to be precomputed during idle time as well as during other periods of processing activity. Specifically, at an onset of each idle-time interval, processing time is allocated to precompute during the remainder of that interval a future task instance, from among a group of such instances then available for precomputation, that will provide the highest fixed or incremental utility. For those task instances which exhibit constant or varying value with time, task selection is based on maximum probability of future occurrence, or net expected value (NEV), respectively, of each such instance. NEV is evaluated as a product of the task instance probability multiplied by a rate of change in the value (EVC flux) to be provided by that task with continued computation time, respectively. This product is assessed, for task instances that exhibit linearly changing value with time, at the onset of each idle-time interval, or, for task instances that exhibit non-linearly changing value, at the onset of each time slice occurring during such an interval. Processing time can be also allocated, at non-idle times, to precomputing a future task instance in lieu of continuing a presently executing task instance, if the future task instance then exhibits a time-discounted NEV that is larger than the EVC flux presently being provided by the currently executing task instance.
摘要:
A system and method for creating a new destination data structure in memory populated with data from fields of an existing source data structure. A representation of the source is selected, dragged over, and dropped onto an icon representing a program module. The source and the program module are each associated with a type of data structure. If these types of data structures are different, then the destination is created in memory of the type associated with the program module. Once the destination is created, the data within the source is transformed to populate predetermined fields of the destination. One way of populating the destination is by determining which field in the destination corresponds to a given field in the source. Data from a given field of the source is loaded into the corresponding field of the destination. This is performed for each of the fields in the source, thus transferring the data into the destination from the source without having to manually re-enter or perform successive copy and paste operations on the data in the fields of the destination. Another way of populating the destination is by formatting data from each of the printable fields of the source into a predetermined rich text format to yield a formatted version of the source as if the source were being printed in one of the fields of the destination. The formatted data is then loaded into the field of the destination.