292 results about "Trade-off" patented technology

A system and method are disclosed for the management of WLANs in cases where unmanaged access points are present as well as with the addition or removal of access points. The disclosed system and method use signal data and network traffic statistics collected by mobile units to determine optimal configuration settings for the access points. The access point settings so managed can include the operating channel or center frequency, orthogonal signal coding used (optionally including the data rate), if any, and the transmission power. The solutions computed can account for the inherent trade-offs between wireless network coverage area and mutual interference that may arises when two or more access points use the same or overlapping frequency bands or channels and the same or similar signal coding.

Improved techniques to utilize and manage a group of media items (or media assets) on a computing device are disclosed. The group of media items can be utilized and managed at a host computer for the host computer as well as a media device (e.g., media player) that can couple to the host computer. One popular example of a group of media items is know as a playlist, which can pertain to a group of audio tracks. One aspect pertains to providing a persistent media device playlist at a host computer. Another aspect pertains to imposing capacity limits to a playlist, such as a media device playlist. Still another aspect pertains to a graphical user interface that enables a user to trade-off storage capacity of a media device between media asset storage and data storage. Yet still another aspect pertains to a graphical user interface that assists a user with selecting media items to fill a group of media items.

Embodiments of the present invention generally relate to a system and method of processing data signals. More specifically, in one embodiment, system architecture splits mixing functions between client and server to enable dynamic switching between a client-server and a peer-to-peer paradigm. In another embodiment, architecture allows one to efficiently trade-off computation in the server and link bandwidth in the network. In another embodiment a system is provided to minimize computational load on server subject to link bandwidth constraint. In another embodiment a system is provided to maximize use of client computational resources. In another embodiment a system is provided to adapt to changing network environments and changing service requirements (e.g. number of clients).

An encrypted file storage solution consists of a cluster of processing nodes, external data storage, and a software agent (the “File System Watcher”), which is installed on the application servers. Cluster sizes of one node up to many hundreds of nodes are possible. There are also remote “Key Servers” which provide various services to one or more clusters. The preceding describes a preferred embodiment, though in some cases it may be desirable to “collapse” some of the functionality into a smaller number of hardware devices, typically trading off cost versus security and fault-tolerance.

Improved techniques to utilize and manage a group of media items (or media assets) on a computing device are disclosed. The group of media items can be utilized and managed at a host computer for the host computer as well as a media device (e.g., media player) that can couple to the host computer. One popular example of a group of media items is know as a playlist, which can pertain to a group of audio tracks. One aspect pertains to a graphical user interface that enables a user to trade-off storage capacity of a media device between media asset storage and data storage. Another aspect pertains to a graphical user interface that assists a user with selecting media items to fill a group of media items. Still another aspect pertains to providing a persistent media device playlist at a host computer. Yet still another aspect pertains to imposing capacity limits to a playlist, such as a media device playlist.

A hierarchical storage system is constructed from file servers and a policy engine server by building upon a file migration service. Offline attributes are added to file system inodes in a primary file server, file system parameters are added in the primary server, an offline read access method field is added to a connection database, and the primary file server is programmed to use these attributes and parameters for selecting a particular method (such as a partial read migration or a pass through read method) for read access to an offline file. In this fashion, the primary file server is provided with flexibility for selecting a particular one of a number of migration methods depending on various conditions, in order to improve the trade-off between the cost of storage and delay in file access.

The present invention is a method and apparatus for protection of various items against counterfeiting using physical unclonable features of item microstructure images. The protection is based on the proposed identification and authentication protocols coupled with portable devices. In both cases a special transform is applied to data that provides a unique representation in the secure key-dependent domain of reduced dimensionality that also simultaneously resolves performance-security-complexity and memory storage requirement trade-offs. The enrolled database needed for the identification can be stored in the public domain without any risk to be used by the counterfeiters. Additionally, it can be easily transportable to various portable devices due to its small size. Notably, the proposed transformations are chosen in such a way to guarantee the best possible performance in terms of identification accuracy with respect to the identification in the raw data domain. The authentication protocol is based on the proposed transform jointly with the distributed source coding. Finally, the extensions of the described techniques to the protection of artworks and secure key exchange and extraction are disclosed in the invention.

A computer display layout manager that reduces the need to hand-craft the layout of application screens is able to rearrange elements according to the shape of the available area. The automated process helps interface designers create user interfaces which work well on multiple devices and in resizeable windows. The layout manager uses height for width and width for height trade-offs to resize elements. The elements of each row or column are packed and resized according to predetermined preferred sizing criteria.

This invention relates to a system and method for valuing a portfolio in terms of its performance relative to a specified benchmark under a range of future scenarios. In particular, the invention takes a portfolio and calculates two values related to the portfolio: the first value corresponding to an amount by which the value of the portfolio is expected to fall below the value of a benchmark over a given time horizon, and a second value corresponding to an amount by which the value of the portfolio is expected to exceed the value of a benchmark over a given time horizon, in view of the range of different future scenarios. The invention provides a means for determining the portfolio which optimally trades-off these two values, and to evaluate risk/reward performance measures using these two values which can be used to rank instruments, securities or portfolios. The invention also provides a means for pricing portfolio insurance for optimal portfolios.

A combination of several analytical computer-assisted modeling techniques may be used to evaluate the value of a brand, the relative value of competitive brands and may identify the opportunities to increase brand value and the priority of those opportunities. Image/Attitudinal driver analysis, pyramid analysis, probability analysis, trade-off analysis, and other regression techniques may be used in novel combinations to quantify brand development, impacts and the overall estimate of brand value. For example: (1) image driver analysis may be applied to each level of a brand pyramid to understand how to most effectively move customers through to the next level in the pyramid; (2) probability analysis may be used to estimate the impact of each movement through the pyramid; and (3) tradeoff analysis may be used to improve the value customers perceive at any particular level of the pyramid.

Systems, methods, and a computer readable medium for performing auto exposure (AE) techniques that are beneficial in variable lighting conditions—and particularly applicable to handheld and/or mobile videoconferencing applications—are disclosed herein. Handheld and/or mobile videoconferencing applications—unlike their fixed camera counterparts—are often exposed to a wide variety of rapidly changing lighting and scene conditions, and thus face a difficult trade-off between adjusting exposure parameter values too frequently or not frequently enough. In personal electronic devices executing such handheld and/or mobile videoconferencing applications, it may be desirable to: use a small, centered, and center-weighted exposure metering region; set a relatively low brightness target value; and adjust the camera's exposure parameter values according to a distance-dependent convergence speed function. The use of such techniques, in conjunction with a relatively large stability region, may also improve the quality of a video encoder's temporal predictions—and thus video quality—in videoconferencing applications.

In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

A system for automated annotation of images and videos points a mobile device towards an object of interest, such as a building or landscape scenery, for the device to display an image of the scene with an annotation for the object. An annotation can include names, historical information, and links to databases of images, videos, and audio files. Different techniques can be used for determining positional placement of annotations, and, by using multiple techniques, positioning can be made more precise and reliable. The level of detail of annotation information can be adjusted according to the precision of the techniques used. A trade-off can be taken into account between precision of annotation and communication cost, delay and/or power consumption. An annotation database can be updated in a self-organizing way. Public information as available on the web can be converted to annotation data.

An automated model componentization feature systematically converts duplicate or otherwise amenable patterns in a model into references. Multiple references are simplified to one unit that contains the otherwise duplicated functionality. Duplicated or selected functionality is identified based on a number of arguments that may be user supplied. These arguments include the level of polymorphism (i.e., which of the sample times, dimensions, and data types can be propagated in) but also the maximum size of the patterns to look for to address the general trade-off of generating few partitions with many blocks or many partitions with few blocks and which modeling constructs are used (e.g., whether Go To/From connections such as in Simulink® are present). Model conversions can result in potentially disjoint partitions.

A power estimation framework based on a network of power monitors that observe component- and system-level execution and power statistics at run time. Based on those statistics, the power monitors (i) select between multiple alternative power models for each component and/or (ii) configure the component power models to best negotiate the trade-off between efficiency and accuracy. This approach effectuates a co-coordinated, adaptive, spatio-temporal allocation of computational effort for power estimation. This approach yields large reductions in power estimation overhead while minimally impacting power estimation accuracy.

Methods and systems are provided for optimally trading off replication overhead and consistency levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized. The systems and methods can be used in any scenario where replicated data have consistency requirements, such as in a replicate overlay assisted resource discovery system.

A method and system for resilient routing reconfiguration, which provides provably congestion-free rerouting under a large number of failure scenarios and achieves efficiency and flexibility in accommodating different performance requirements, is disclosed. The method of embodiments comprises an offline precomputation phase and an online reconfiguration phase. Embodiments of the present invention also provide a number of useful functionalities, including (i) coping with traffic variations, (ii) supporting realistic failure scenarios, (iii) accommodating prioritized traffic with different protection levels, and (iv) balancing the trade-off between performance and resilience.

A mechanism for constructing Steiner trees using simultaneous blockage avoidance, delay optimization, and design density management are provided. An initial tiled timing-driven Steiner tree is obtained for an integrated circuit design. The Steiner tree is broken into 2-paths for which plates are generated designated the permissible area in which a Steiner point may migrate. Each 2-path is optimized by calculating a cost for each tile in the plate as a function of an environmental cost, a tile delay cost, and a trade-off value. A minimum cost tile is then selected as the point to which the Steiner point in the 2-path, if any, is to migrate. Once each 2-path is processed in this manner, routing is performed so as to minimize the cost at the source. This process may be iteratively repeated with new trade-off values until all of the nets have zero or positive slew.

The present invention provides an improved HRTF modeling technique for synthesizing HRTFs with varying degrees of smoothness and generalization. A plurality N of spatial characteristic function sets are regularized or smoothed before combination with corresponding Eigen filter functions, and summed to provide an HRTF (or HRIR) filter having improved smoothness in a continuous auditory space. A trade-off is allowed between accuracy in localization and smoothness by controlling the smoothness level of the regularizing models with a lambda factor. Improved smoothness in the HRTF filter allows the perception by the listener of a smoothly moving sound rendering free of annoying discontinuities creating clicks in the 3D sound.