Wireless lan cell breathing
    1.
    发明申请
    Wireless lan cell breathing 失效
    无线蓝牙呼吸

    公开(公告)号:US20070248059A1

    公开(公告)日:2007-10-25

    申请号:US11409132

    申请日:2006-04-21

    IPC分类号: H04Q7/24

    摘要: Utilization of wireless access points (APs) is optimized by dynamically managing transmitted AP power levels of beacon packets to control wireless AP coverage. This permits traffic congestion at one wireless AP to be reduced and shifted to other wireless APs. AP coverage management is provided by a centralized mechanism that employs various interpretations and/or measurements of client received power to handle dynamic changes in client workloads. The control does not require protocol changes to clients that utilize a wireless AP and can also incorporate hand-off costs and/or manufacturer specified power level constraints. Thus, these techniques can be employed in existing wireless LANs without impacting clients. Various instances are employable with continuous power and/or discrete power based wireless APs, providing a non-client impacted means to increase throughput and/or load balance.

    摘要翻译: 无线接入点(AP)的利用通过动态管理信标分组的传输AP功率级别来优化,以控制无线AP覆盖。 这允许一个无线AP的业务拥塞减少并转移到其他无线AP。 AP覆盖管理由集中式机制提供,该机制采用客户接收功率的各种解释和/或测量来处理客户端工作负载中的动态变化。 该控制不需要对使用无线AP的客户端进行协议更改,并且还可以包含切换成本和/或制造商规定的功率级别约束。 因此,这些技术可以在现有的无线LAN中使用,而不影响客户端。 基于连续功率和/或离散功率的无线AP可采用各种实例,提供非客户端影响的装置以增加吞吐量和/或负载平衡。

    Wireless LAN cell breathing
    2.
    发明授权
    Wireless LAN cell breathing 失效
    无线局域网细胞呼吸

    公开(公告)号:US07715353B2

    公开(公告)日:2010-05-11

    申请号:US11409132

    申请日:2006-04-21

    IPC分类号: H04Q7/24

    摘要: Utilization of wireless access points (APs) is optimized by dynamically managing transmitted AP power levels of beacon packets to control wireless AP coverage. This permits traffic congestion at one wireless AP to be reduced and shifted to other wireless APs. AP coverage management is provided by a centralized mechanism that employs various interpretations and/or measurements of client received power to handle dynamic changes in client workloads. The control does not require protocol changes to clients that utilize a wireless AP and can also incorporate hand-off costs and/or manufacturer specified power level constraints. Thus, these techniques can be employed in existing wireless LANs without impacting clients. Various instances are employable with continuous power and/or discrete power based wireless APs, providing a non-client impacted means to increase throughput and/or load balance.

    摘要翻译: 无线接入点(AP)的利用通过动态管理信标分组的传输AP功率级别来优化,以控制无线AP覆盖。 这允许一个无线AP的业务拥塞减少并转移到其他无线AP。 AP覆盖管理由集中式机制提供,该机制采用客户接收功率的各种解释和/或测量来处理客户端工作负载中的动态变化。 该控制不需要对使用无线AP的客户端进行协议更改,并且还可以包含切换成本和/或制造商规定的功率级别约束。 因此,这些技术可以在现有的无线LAN中使用,而不影响客户端。 基于连续功率和/或离散功率的无线AP可采用各种实例,提供非客户端影响的装置以增加吞吐量和/或负载平衡。

    Generalized deadlock resolution in databases
    3.
    发明申请
    Generalized deadlock resolution in databases 审中-公开
    数据库中的广义死锁解决方案

    公开(公告)号:US20070106667A1

    公开(公告)日:2007-05-10

    申请号:US11271130

    申请日:2005-11-10

    IPC分类号: G06F17/30

    CPC分类号: G06F16/2343

    摘要: AND/OR graphs representative of database transactions are leveraged to facilitate in providing transaction deadlock resolutions with a guarantee in performance. In one instance, predominantly OR-based transaction deadlocks are resolved via killing a minimum cost set of graph nodes to release associated resources. This process can be performed cyclically to resolve additional deadlocks. This allows a minimal impact approach to resolving deadlocks without requiring wholesale cancellation of all transactions and restarting of entire systems. In another instance, a model is provided that facilitates in resolving deadlocks permanently. In an AND-based transaction case, a bipartite mixed graph is employed to provide a graph representative of adversarially schedulable transactions that can acquire resource locks in any order without deadlocking.

    摘要翻译: 利用代表数据库事务的AND / OR图来促进提供事务死锁分辨率和性能保证。 在一种情况下,主要是基于OR的事务死锁通过杀死图形节点的最小成本集来解除,以释放相关资源。 可以循环执行此过程以解决额外的死锁。 这样可以实现最小的影响力来解决死锁,而不需要批量取消所有事务并重新启动整个系统。 在另一种情况下,提供了有助于永久解决死锁的模型。 在基于AND的交易案例中,采用二分混合图来提供代表可以以任何顺序获取资源锁而没有死锁的对话可调度事务的图。

    UNIFIED PLATFORM FOR REPUTATION AND SECURE TRANSACTIONS
    5.
    发明申请
    UNIFIED PLATFORM FOR REPUTATION AND SECURE TRANSACTIONS 审中-公开
    统一平台和安全交易平台

    公开(公告)号:US20080301055A1

    公开(公告)日:2008-12-04

    申请号:US11755987

    申请日:2007-05-31

    IPC分类号: G06Q30/00 H04L9/32

    摘要: The claimed subject matter provides a unified platform system and/or a method that facilitates optimizing an online transaction. The unified platform system can include a secured transaction component that can secure a portion of transactional data related to an online transaction between at least one buyer and at least one merchant utilizing a secure transaction technique. The unified platform system can include a reputation assessment component that can receive a portion of reputation data related to at least one of the buyer or the merchant based at least in part upon verifying completion of the online transaction between such buyer and merchant. The unified platform system can publish the portion of reputation data coupled with a portion of non-private transactional data to provide context for the reputation data.

    摘要翻译: 所要求保护的主题提供了有利于优化在线交易的统一平台系统和/或方法。 统一平台系统可以包括安全交易组件,其可以利用安全交易技术来确保在至少一个买方和至少一个商家之间的在线交易相关的一部分事务数据。 统一平台系统可以包括信誉评估组件,其至少部分地基于验证在这种买方和商家之间的在线交易的完成来接收与至少一个买方或商家相关的一部分信誉数据。 统一的平台系统可以发布与非私有事务数据的一部分相结合的信誉数据部分,为信誉数据提供上下文。

    Optimal policies for load balancing for distributed and strategic agents (more technically, optimal coordination mechanisms for machine scheduling)
    7.
    发明授权
    Optimal policies for load balancing for distributed and strategic agents (more technically, optimal coordination mechanisms for machine scheduling) 有权
    用于分布式和战略代理的负载平衡的最优策略(技术上更为机器调度的最佳协调机制)

    公开(公告)号:US08028293B2

    公开(公告)日:2011-09-27

    申请号:US11770667

    申请日:2007-06-28

    IPC分类号: G06F9/46 G06F15/173

    摘要: Providing for scheduling tasks in a distributed system based on an inefficiency of each task on a particular machine as compared with available networked machines is described herein. By way of example, a distribution component can receive a plurality of tasks at a machine assigned by at least one independent agent. In addition, an ordering component can schedule each task on a machine as a function of non-decreasing inefficiency. Such a policy can be implemented locally at the machine, minimizing inter-device communication, while only marginally increasing completion time for the set of tasks. In such a manner, the subject disclosure provides for load balancing of distributed systems in a manner that utilizes fewer resources than conventional approaches.

    摘要翻译: 这里描述了与可用的联网机器相比,基于特定机器上的每个任务的低效率来提供分布式系统中的调度任务。 作为示例,分发组件可以在由至少一个独立代理分配的机器上接收多个任务。 此外,订购组件可以将机器上的每个任务作为不降低的无效率的函数进行调度。 这样的策略可以在机器本地实现,从而最小化设备间通信,同时仅稍微增加该组任务的完成时间。 以这种方式,主题公开以与传统方法相比较少的资源的方式提供分布式系统的负载平衡。

    OPTIMAL POLICIES FOR LOAD BALANCING FOR DISTRIBUTED AND STRATEGIC AGENTS (MORE TECHNICALLY, OPTIMAL COORDINATION MECHANISMS FOR MACHINE SCHEDULING)
    8.
    发明申请
    OPTIMAL POLICIES FOR LOAD BALANCING FOR DISTRIBUTED AND STRATEGIC AGENTS (MORE TECHNICALLY, OPTIMAL COORDINATION MECHANISMS FOR MACHINE SCHEDULING) 有权
    用于分布式和策略性代理的负载均衡的最佳政策(更具技术性的是机器调度的最佳协调机制)

    公开(公告)号:US20090007101A1

    公开(公告)日:2009-01-01

    申请号:US11770667

    申请日:2007-06-28

    IPC分类号: G06F9/455 G06F9/46

    摘要: Providing for scheduling tasks in a distributed system based on an inefficiency of each task on a particular machine as compared with available networked machines is described herein. By way of example, a distribution component can receive a plurality of tasks at a machine assigned by at least one independent agent. In addition, an ordering component can schedule each task on a machine as a function of non-decreasing inefficiency. Such a policy can be implemented locally at the machine, minimizing inter-device communication, while only marginally increasing completion time for the set of tasks. In such a manner, the subject disclosure provides for load balancing of distributed systems in a manner that utilizes fewer resources than conventional approaches.

    摘要翻译: 这里描述了与可用的联网机器相比,基于特定机器上的每个任务的低效率来提供分布式系统中的调度任务。 作为示例,分发组件可以在由至少一个独立代理分配的机器上接收多个任务。 此外,订购组件可以将机器上的每个任务作为不降低的无效率的函数进行调度。 这样的策略可以在机器本地实现,从而最小化设备间通信,同时仅稍微增加该组任务的完成时间。 以这种方式,主题公开以与传统方法相比较少的资源的方式提供分布式系统的负载平衡。

    Systems and methods for modeling approximate market equilibria
    10.
    发明申请
    Systems and methods for modeling approximate market equilibria 失效
    建立近似市场均衡的系统和方法

    公开(公告)号:US20050187803A1

    公开(公告)日:2005-08-25

    申请号:US10782687

    申请日:2004-02-19

    IPC分类号: G06Q30/00 G06Q40/00 G06F17/60

    摘要: The present invention leverages demarcation of an agent into both a demander and a supplier to provide a polynomial-time method of approximating a supply and demand system's equilibrium value. This provides, in one instance of the present invention, a simplified means to iteratively extract the equilibrium value. By providing demarcated data, the present invention accounts for both demand and supply effects of an agent within a modeled supply and demand system. In one instance of the present invention, a market equilibrium price vector is approximated by employing a revenue value generated for an agent in a current market equilibrium price iteration as a budget value for the agent in the next iteration. This permits market equilibrium value modeling that encompasses an agent's contributions to a market both as a buyer and a seller within the same market for a given good and/or service.

    摘要翻译: 本发明利用代理商对需求者和供应商的划分,以提供近似供需系统的均衡值的多项式时间方法。 这在本发明的一个实例中提供了迭代地提取平衡值的简化方法。 通过提供划分的数据,本发明考虑了在建模的供应和需求系统内的代理的需求和供应效应。 在本发明的一个实例中,通过使用在当前市场均衡价格迭代中为代理产生的收入值作为下一次迭代中的代理的预算值来近似市场均衡价格向量。 这允许市场均衡价值模型,其包括代理人作为买方和卖方在同一市场中作为给定的商品和/或服务的贡献。